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 11, 2026 23:34Victor MerckléVictor MerckléScore: 65,300Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 23:3564,79434,841,29622,969,0001,005,0002,113,536
2May 11, 2026 23:3565,04534,502,74523,043,0001,024,0002,113,536
3May 11, 2026 23:3565,11334,373,07523,016,0001,076,0002,113,536
4May 11, 2026 23:3565,17234,883,18323,022,0001,092,0002,113,536
5May 11, 2026 23:3565,30034,947,82323,066,0001,095,0002,113,536
6May 11, 2026 23:3565,31833,240,54223,073,0001,095,0002,113,536
7May 11, 2026 23:3565,34335,918,93623,159,0001,018,0002,113,536
8May 11, 2026 23:3565,66233,405,04523,202,0001,093,0002,113,536
9May 11, 2026 23:3565,67833,571,29923,207,0001,094,0002,113,536