Finding a billion factorials in 60 ms with SIMD (codeforces.com) | HN Screenshots

YHacker Newsscreenshots

Screenshot of codeforces.com: Finding a billion factorials in 60 ms with SIMD

First screen, captured 1 year ago.

Looks similar

Screenshot of codeforces.com: A Beautiful Technique for Some XOR Related Problems

A Beautiful Technique for Some XOR Related Problems (codeforces.com)

45 points by blobcode 1 year ago | 4 comments

Screenshot of codeforces.com: DeepMind and OpenAI win gold at ICPC

DeepMind and OpenAI win gold at ICPC (codeforces.com)

226 points by notemap 1 year ago | 213 comments

Screenshot of scottaaronson.blog: Rosser's Theorem via Turing Machines (2011)

Rosser's Theorem via Turing Machines (2011)(scottaaronson.blog)

59 points by dargscisyhp 2 years ago | 8 comments

Screenshot of eli.thegreenplace.net: How big are factorials?

How big are factorials?(eli.thegreenplace.net)

75 points by ibobev 1 month ago | 31 comments

Screenshot of utcc.utoronto.ca: Notes on the Cost of Go Finalizers

Notes on the Cost of Go Finalizers (utcc.utoronto.ca)

58 points by ingve 3 years ago | 5 comments

Screenshot of gus-massa.blogspot.com: Decomposing factorial of 300K as the product of 300K factors larger than 100K

Decomposing factorial of 300K as the product of 300K factors larger than 100K (gus-massa.blogspot.com)

90 points by gus_massa 1 year ago | 9 comments