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 listSep 4, 2026 07:18Victor MerckléVictor MerckléScore: 56,451Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 4, 2026 07:2156,28330,051,67619,805,0001,020,0002,117,632stderr
2Sep 4, 2026 07:2156,36230,049,94619,824,0001,030,0002,117,632stderr
3Sep 4, 2026 07:2156,38929,279,16219,828,0001,036,0002,117,632stderr
4Sep 4, 2026 07:2156,39429,351,47219,849,0001,017,0002,117,632stderr
5Sep 4, 2026 07:2156,45129,228,56819,874,0001,013,0002,117,632stderr
6Sep 4, 2026 07:2156,48329,282,23919,878,0001,021,0002,117,632stderr
7Sep 4, 2026 07:2156,52730,015,59819,872,0001,043,0002,117,632stderr
8Sep 4, 2026 07:2156,81329,386,67919,965,0001,056,0002,117,632stderr
9Sep 4, 2026 07:21143,70561,575,17352,141,0001,030,0002,117,632stderr