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 17:43M-RochatM-RochatScore: 59,962Success
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 17:4459,66232,685,95020,995,0001,080,0002,113,536
2May 18, 2026 17:4459,67832,759,89921,010,0001,071,0002,113,536
3May 18, 2026 17:4459,93733,091,71521,097,0001,080,0002,113,536
4May 18, 2026 17:4459,96232,412,51521,174,0001,012,0002,113,536
5May 18, 2026 17:4459,96232,177,18621,017,0001,169,0002,113,536
6May 18, 2026 17:4459,96731,345,66521,029,0001,159,0002,113,536
7May 18, 2026 17:4460,07233,140,94321,067,0001,160,0002,113,536
8May 18, 2026 17:4460,10232,367,87621,080,0001,158,0002,113,536
9May 18, 2026 17:4460,33531,993,75221,159,0001,165,0002,113,536