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 17, 2026 14:53M-RochatM-RochatScore: 64,024Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 14:5563,80033,477,86722,534,0001,072,0002,113,536
2May 17, 2026 14:5563,94536,138,87322,600,0001,060,0002,113,536
3May 17, 2026 14:5563,95936,594,31722,552,0001,113,0002,113,536
4May 17, 2026 14:5564,00533,845,74122,633,0001,049,0002,113,536
5May 17, 2026 14:5564,02433,230,30722,618,0001,071,0002,113,536
6May 17, 2026 14:5564,07035,457,23222,647,0001,059,0002,113,536
7May 17, 2026 14:5564,13233,767,57022,663,0001,066,0002,117,632
8May 17, 2026 14:5564,22135,456,24022,752,0001,010,0002,113,536
9May 17, 2026 14:5564,39734,730,58222,762,0001,065,0002,113,536