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 08:06Victor MerckléVictor MerckléScore: 56,289Success
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 08:1456,03529,148,30620,733,00002,117,632stderr
2Sep 4, 2026 08:1456,04529,089,83420,737,00002,117,632stderr
3Sep 4, 2026 08:1456,14028,870,75520,772,00002,117,632stderr
4Sep 4, 2026 08:1456,27529,022,79519,770,0001,052,0002,117,632stderr
5Sep 4, 2026 08:1456,28929,236,23119,781,0001,046,0002,117,632stderr
6Sep 4, 2026 08:1456,32130,065,46519,828,0001,011,0002,117,632stderr
7Sep 4, 2026 08:1456,42930,068,39419,845,0001,034,0002,117,632stderr
8Sep 4, 2026 08:1456,45630,012,48419,864,0001,025,0002,117,632stderr
9Sep 4, 2026 08:1456,59729,130,50919,884,0001,057,0002,117,632stderr