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 24, 2026 23:09Victor MerckléVictor MerckléScore: 71,418Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 24, 2026 23:1071,24335,454,02625,075,0001,285,0002,117,632stderr
2Jun 24, 2026 23:1071,28335,439,71825,353,0001,022,0002,117,632stderr
3Jun 24, 2026 23:1071,37036,783,93625,121,0001,286,0002,117,632stderr
4Jun 24, 2026 23:1071,37835,537,85725,126,0001,284,0002,117,632stderr
5Jun 24, 2026 23:1071,41835,490,69625,142,0001,283,0002,117,632stderr
6Jun 24, 2026 23:1071,44535,546,71325,412,0001,023,0002,117,632stderr
7Jun 24, 2026 23:1071,60835,647,16525,473,0001,022,0002,117,632stderr
8Jun 24, 2026 23:1071,68335,639,42025,229,0001,294,0002,117,632stderr
9Jun 24, 2026 23:1071,71035,660,17625,510,0001,023,0002,117,632stderr