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:16M-RochatM-RochatScore: 59,713Success
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:1859,48931,276,71620,926,0001,085,0002,113,536
2May 18, 2026 18:1859,51833,269,50720,921,0001,101,0002,113,536
3May 18, 2026 18:1859,58633,526,14620,935,0001,112,0002,113,536
4May 18, 2026 18:1859,62734,267,06520,884,0001,178,0002,113,536
5May 18, 2026 18:1859,71331,385,34320,927,0001,167,0002,113,536
6May 18, 2026 18:1859,86231,866,58120,988,0001,161,0002,113,536
7May 18, 2026 18:1859,88132,753,90521,004,0001,152,0002,113,536
8May 18, 2026 18:1862,00848,796,06421,884,0001,059,0002,113,536
9May 18, 2026 18:18117,50054,583,55842,469,0001,006,0002,113,536