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 16, 2026 16:42M-RochatM-RochatScore: 68,721Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 16, 2026 16:4268,58135,842,72424,354,0001,021,0002,113,536
2May 16, 2026 16:4268,61034,126,51624,364,0001,022,0002,113,536
3May 16, 2026 16:4268,64336,887,55024,366,0001,032,0002,113,536
4May 16, 2026 16:4268,67836,785,41024,385,0001,026,0002,113,536
5May 16, 2026 16:4268,72135,736,32524,392,0001,035,0002,113,536
6May 16, 2026 16:4268,74334,113,82624,425,0001,010,0002,113,536
7May 16, 2026 16:4268,77834,674,33424,425,0001,023,0002,113,536
8May 16, 2026 16:4268,90836,260,00824,441,0001,055,0002,113,536
9May 16, 2026 16:4269,62938,198,22824,753,0001,010,0002,113,536