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 16:52Victor MerckléVictor MerckléScore: 72,835Success
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 16:5372,35935,913,24225,663,0001,110,0002,113,536
2May 11, 2026 16:5372,59738,000,42625,848,0001,013,0002,113,536
3May 11, 2026 16:5372,69437,854,24125,698,0001,199,0002,113,536
4May 11, 2026 16:5372,75137,533,78525,907,0001,011,0002,113,536
5May 11, 2026 16:5372,83535,844,05025,939,0001,010,0002,113,536
6May 11, 2026 16:5372,90536,025,94725,891,0001,084,0002,113,536
7May 11, 2026 16:5373,04038,639,25625,898,0001,127,0002,113,536
8May 11, 2026 16:5373,15937,693,87826,048,0001,021,0002,113,536
9May 11, 2026 16:5373,18337,731,74026,055,0001,023,0002,113,536