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 listJun 24, 2026 23:56Victor MerckléVictor MerckléScore: 67,291Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 24, 2026 23:5667,10833,980,55823,708,0001,122,0002,117,632stderr
2Jun 24, 2026 23:5667,24033,910,97423,778,0001,101,0002,117,632stderr
3Jun 24, 2026 23:5667,25933,989,04523,868,0001,018,0002,117,632stderr
4Jun 24, 2026 23:5667,25934,010,10423,773,0001,113,0002,117,632stderr
5Jun 24, 2026 23:5667,29134,180,94123,876,0001,022,0002,117,632stderr
6Jun 24, 2026 23:5667,51036,669,94123,955,0001,024,0002,117,632stderr
7Jun 24, 2026 23:5667,80234,180,72224,072,0001,015,0002,117,632stderr
8Jun 24, 2026 23:5667,82734,259,49724,079,0001,017,0002,117,632stderr
9Jun 24, 2026 23:5667,87234,279,73524,087,0001,026,0002,117,632stderr