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 12, 2026 01:34Victor MerckléVictor MerckléScore: 64,867Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 12, 2026 01:3564,70832,717,70322,849,0001,093,0002,113,536
2May 12, 2026 01:3564,72434,574,75522,849,0001,099,0002,113,536
3May 12, 2026 01:3564,78934,530,45522,885,0001,087,0002,113,536
4May 12, 2026 01:3564,83535,391,74022,906,0001,083,0002,113,536
5May 12, 2026 01:3564,86733,095,47122,924,0001,077,0002,113,536
6May 12, 2026 01:3564,90232,782,64122,922,0001,092,0002,113,536
7May 12, 2026 01:3565,22734,236,05223,056,0001,078,0002,113,536
8May 12, 2026 01:3565,27033,545,57623,050,0001,100,0002,113,536
9May 12, 2026 01:3565,28132,896,15423,077,0001,077,0002,113,536