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 20:54M-RochatM-RochatScore: 67,824Success
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 20:5667,45935,932,98023,947,0001,013,0002,113,536
2May 16, 2026 20:5667,45938,436,31523,931,0001,029,0002,113,536
3May 16, 2026 20:5667,50233,874,21323,964,0001,012,0002,113,536
4May 16, 2026 20:5667,70235,766,55424,018,0001,032,0002,113,536
5May 16, 2026 20:5667,82433,684,80924,082,0001,013,0002,113,536
6May 16, 2026 20:5667,99436,878,47224,133,0001,025,0002,113,536
7May 16, 2026 20:5668,00035,651,22524,139,0001,021,0002,113,536
8May 16, 2026 20:5668,31336,632,04824,256,0001,020,0002,113,536
9May 16, 2026 20:5671,81850,088,79725,485,0001,088,0002,117,632