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 05:13M-RochatM-RochatScore: 59,867Success
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 05:1659,68333,370,81221,024,0001,059,0002,113,536
2May 18, 2026 05:1659,70832,691,94521,018,0001,074,0002,113,536
3May 18, 2026 05:1659,74031,403,46120,962,0001,142,0002,113,536
4May 18, 2026 05:1659,78632,283,00120,967,0001,154,0002,113,536
5May 18, 2026 05:1659,86731,336,32421,015,0001,136,0002,113,536
6May 18, 2026 05:1659,91333,052,39421,078,0001,090,0002,113,536
7May 18, 2026 05:1659,95131,841,87121,025,0001,157,0002,113,536
8May 18, 2026 05:1660,07533,445,47021,059,0001,169,0002,113,536
9May 18, 2026 05:1660,09733,371,78821,082,0001,154,0002,113,536