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:23M-RochatM-RochatScore: 59,705Success
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:2559,57531,417,22420,879,0001,164,0002,113,536
2May 18, 2026 18:2559,62433,490,36120,897,0001,164,0002,113,536
3May 18, 2026 18:2559,65632,372,59320,927,0001,146,0002,113,536
4May 18, 2026 18:2559,70033,271,36820,925,0001,164,0002,113,536
5May 18, 2026 18:2559,70534,262,35720,920,0001,171,0002,113,536
6May 18, 2026 18:2559,73231,595,88321,022,0001,079,0002,113,536
7May 18, 2026 18:2559,76731,460,76220,966,0001,148,0002,113,536
8May 18, 2026 18:2559,87531,457,79620,984,0001,170,0002,113,536
9May 18, 2026 18:2559,89133,812,99721,144,0001,016,0002,113,536