Software Alternatives, Accelerators & Startups
Table of contents
  1. Social Mentions

NoPaste is a client-side paste service which works with no database, and no back-end code Reviews and details

Screenshots and images

  • Landing page
    Landing page //


Promote You can add any of these badges on your website.

SaaSHub badge
Show embed code


We don't have any videos for yet.

Social recommendations and mentions

We have tracked the following product recommendations or mentions on various public social media platforms and blogs. They can help you see what people think about and what they use it for.
  • [2017 day 15] "at most 15 seconds on ten-year-old hardware", really?
    And as long as we're complaining about compute-heavy problems, 2016 day 5 is the worst; it took 3 hours and 11 minutes to complete in m4 on my hardware (computing md5 in python involves calling into a library which in turn probably uses pre-compiled C code rather than native python for the core computations, but computing it natively in m4 is just painfully slow). Source: about 3 years ago
  • [2018 day 14][m4] reduced memory solution
    So I coded up something that I did not see mentioned anywhere in the megathread. Instead of storing just the recipe number in each array location, with an array entry for every recipe, I stored a tuple of recipe number and next array position. For a0-a22, the next number is pre-computed. But for a23 onwards, the next array position is exactly one larger - that is, the rest of my array stores ONLY the recipes... Source: about 3 years ago
  • [2018 day 2][m4] optimizing the search for similar words
    So my next round did what many of the megathread solutions did: for each pair of input lines, determine if they are similar. This cuts the complexity from exponential O(2^n) to quadratic O(n^2), and runtime was down to 1.3s (a 300x speedup over regex abuse). Note that due to the use of substr, I risk inadvertent macro expansion if slicing a lower-case line forms a macro name such as 'nl', so I had to further... Source: over 3 years ago
  • [2015 day 10][m4] optimizing by matrix multiplication
    Wow, that really made a difference! I got another ~250x speedup (best-case run from ~18.5s to 71ms) with this tweak. Instead of performing a full matrix multiply (O(1) work per iteration regardless of active rows, and O(log n) iterations), I take advantage of the sparseness of the initial few iterations. That is, I start out with only one row active; (however, by iteration 50 all 92 rows are active), as well as... Source: over 3 years ago
  • [2017 day 15][m4] solution using signed 32-bit math and no division
    Or course, only after I had written my entire solution did I notice in the megathread that avoiding division when computing math modulo M31 (0x7fffffff) is already a known optimization. But I thought it was pretty cool that I was able to derive that optimization from something more general, and that my solution works without any 64-bit math or explicit division operators. Source: over 3 years ago
  • [2015 day 6][m4] reducing the amount of work with sweep lines
    But while that was still fairly easy to write (and more compact in m4 than in the pseudocode), I was annoyed that it had O(n) behavior. Since the list of known ranges is sorted, we should be able to perform O(log n) lookup/insertion on that list. With m4, this is painful: it's easy to access the front of a list or stack, but random access to the middle requires implementing some other data structure on top, and... Source: over 3 years ago
  • [2015 day 10][m4] optimizing by matrix multiplication
    With that done, my updated code now executes in 18s (a 6x speedup), and more importantly, I can pick other limits (such as 60) with the change in timing related ONLY to how many matrix multiplications are required to reach that limit (and only insofar as I don't overflow m4's signed 32-bit math limits), no additional memory due to string expansion is required (my character comparisons were limited to the initial... Source: over 3 years ago

Do you know an article comparing to other products?
Suggest a link to a post with product alternatives.

Suggest an article discussion

Log in or Post with

This is an informative page about You can review and discuss the product here. The primary details have not been verified within the last quarter, and they might be outdated. If you think we are missing something, please use the means on this page to comment or suggest changes. All reviews and comments are highly encouranged and appreciated as they help everyone in the community to make an informed choice. Please always be kind and objective when evaluating a product and sharing your opinion.