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 02:16M-RochatM-RochatScore: 64,018Success
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 02:1763,76735,902,98622,523,0001,071,0002,113,536
2May 18, 2026 02:1763,78633,575,39822,482,0001,119,0002,113,536
3May 18, 2026 02:1763,81834,463,51522,521,0001,092,0002,113,536
4May 18, 2026 02:1763,84333,666,63722,535,0001,087,0002,113,536
5May 18, 2026 02:1764,01833,316,24722,603,0001,084,0002,113,536
6May 18, 2026 02:1764,04532,955,51622,582,0001,115,0002,113,536
7May 18, 2026 02:1764,07836,007,26922,615,0001,094,0002,113,536
8May 18, 2026 02:1764,12133,218,71122,656,0001,069,0002,113,536
9May 18, 2026 02:1764,67036,366,13322,825,0001,103,0002,113,536