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 listAug 2, 2026 06:48Victor MerckléVictor MerckléScore: 59,108Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2026 06:4958,99430,244,71920,805,0001,023,0002,113,536
2Aug 2, 2026 06:4959,02729,967,02120,832,0001,008,0002,113,536
3Aug 2, 2026 06:4959,07230,008,22120,849,0001,008,0002,113,536
4Aug 2, 2026 06:4959,10830,006,37720,859,0001,011,0002,113,536
5Aug 2, 2026 06:4959,10830,048,90220,861,0001,009,0002,113,536
6Aug 2, 2026 06:4959,17030,308,57821,893,00002,113,536
7Aug 2, 2026 06:4959,19430,074,18420,877,0001,025,0002,113,536
8Aug 2, 2026 06:4959,31830,099,99720,912,0001,036,0002,113,536
9Aug 2, 2026 06:4959,37530,294,12320,943,0001,026,0002,113,536