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 21, 2026 18:30M-RochatM-RochatScore: 61,172Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 21, 2026 18:3160,96232,799,78721,498,0001,058,0002,113,536
2May 21, 2026 18:3160,98633,894,96321,495,0001,070,0002,113,536
3May 21, 2026 18:3161,01832,369,92321,435,0001,142,0002,113,536
4May 21, 2026 18:3161,09733,724,22821,443,0001,163,0002,113,536
5May 21, 2026 18:3161,17232,224,31921,557,0001,077,0002,113,536
6May 21, 2026 18:3161,17833,338,04421,478,0001,158,0002,113,536
7May 21, 2026 18:3161,21332,840,76821,572,0001,077,0002,113,536
8May 21, 2026 18:3161,47034,050,13921,670,0001,074,0002,113,536
9May 21, 2026 18:3161,51334,389,55921,601,0001,159,0002,113,536