TopK Sergey Svistunov

Find the sum of the 100 largest values in a stream of binary integers as fast as possible.

Input: 100 000 000 uint32 values in little-endian binary on STDIN (4 bytes each).

Output: The uint64 sum of the top 100 greatest values, printed as a decimal string.

Back to listMay 18, 2026 18:33M-RochatM-RochatScore: 59,518Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 18, 2026 18:3459,36234,338,41820,888,0001,076,0002,113,536
2May 18, 2026 18:3459,42132,049,51220,906,0001,080,0002,113,536
3May 18, 2026 18:3459,46434,011,97120,915,0001,087,0002,113,536
4May 18, 2026 18:3459,47231,752,49720,943,0001,062,0002,113,536
5May 18, 2026 18:3459,51833,467,48420,862,0001,160,0002,113,536
6May 18, 2026 18:3459,65131,219,04120,988,0001,083,0002,113,536
7May 18, 2026 18:3459,65933,520,84220,897,0001,177,0002,113,536
8May 18, 2026 18:3459,72932,118,49920,941,0001,159,0002,113,536
9May 18, 2026 18:3459,84334,124,59020,972,0001,170,0002,113,536