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:37M-RochatM-RochatScore: 59,945Success
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:4759,59432,614,58920,986,0001,064,0002,113,536
2May 18, 2026 05:4759,76434,283,88921,023,0001,090,0002,113,536
3May 18, 2026 05:4759,78631,270,41720,969,0001,152,0002,113,536
4May 18, 2026 05:4759,86231,943,10621,005,0001,144,0002,113,536
5May 18, 2026 05:4759,94532,133,22921,031,0001,149,0002,113,536
6May 18, 2026 05:4759,99735,057,14421,145,0001,054,0002,113,536
7May 18, 2026 05:4760,10234,368,47621,087,0001,151,0002,113,536
8May 18, 2026 05:4760,12434,407,25121,071,0001,175,0002,113,536
9May 18, 2026 05:47117,01352,939,33842,135,0001,160,0002,113,536