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 listMar 4, 2026 03:50olliecrowolliecrowScore: 70,189Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 4, 2026 03:5069,96551,582,26224,892,000995,0002,277,376
2Mar 4, 2026 03:5070,18953,358,01124,972,000998,0002,277,376
3Mar 4, 2026 03:5071,04355,472,81624,339,0001,947,0002,277,376