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 listJan 12, 2026 14:14Josu San MartinJosu San MartinScore: 71,922Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 12, 2026 14:1471,68153,017,35326,522,00002,367,488
2Jan 12, 2026 14:1471,92251,331,27726,611,00002,289,664
3Jan 12, 2026 14:1472,45457,323,29825,816,000992,0002,355,200