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:20M-RochatM-RochatScore: 59,937Success
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:2159,84533,279,61520,970,0001,173,0002,113,536
2May 18, 2026 17:2159,85133,624,39520,991,0001,154,0002,113,536
3May 18, 2026 17:2159,88132,807,40720,997,0001,159,0002,113,536
4May 18, 2026 17:2159,89731,370,97421,015,0001,147,0002,113,536
5May 18, 2026 17:2159,93734,307,58621,095,0001,082,0002,113,536
6May 18, 2026 17:2159,93731,970,36021,012,0001,165,0002,113,536
7May 18, 2026 17:2159,98931,458,94921,025,0001,171,0002,113,536
8May 18, 2026 17:2160,02133,072,83521,053,0001,155,0002,113,536
9May 18, 2026 17:2160,05431,907,48421,052,0001,168,0002,113,536