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 13, 2026 00:10Josu San MartinJosu San MartinScore: 70,241Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 13, 2026 00:0870,07857,345,50924,932,000997,0002,371,584
2Jan 13, 2026 00:1070,11951,781,66223,949,0001,995,0002,363,392
3Jan 13, 2026 00:0870,22451,356,87124,984,000999,0002,367,488
4Jan 13, 2026 00:1070,24156,612,09824,990,000999,0002,289,664
5Jan 13, 2026 00:1070,34358,774,59324,025,0002,002,0002,367,488
6Jan 13, 2026 00:0870,58152,119,39624,107,0002,008,0002,359,296