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 9, 2026 20:31Victor MerckléVictor MerckléScore: 67,327Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 9, 2026 20:3267,02433,815,37023,825,000974,0002,138,112
2Jun 9, 2026 20:3267,15933,995,98123,849,0001,000,0002,146,304
3Jun 9, 2026 20:3267,27834,032,38022,974,0001,919,0002,138,112
4Jun 9, 2026 20:3267,32433,927,92723,895,0001,015,0002,138,112
5Jun 9, 2026 20:3267,32734,364,95423,910,0001,001,0002,146,304
6Jun 9, 2026 20:3267,47034,022,96323,048,0001,916,0002,138,112
7Jun 9, 2026 20:3267,66434,173,07624,058,000978,0002,138,112
8Jun 9, 2026 20:3267,85134,281,24623,195,0001,910,0002,138,112
9Jun 9, 2026 20:3267,86434,231,12724,093,0001,017,0002,146,304