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 listJul 2, 2026 20:40Victor MerckléVictor MerckléScore: 56,975Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 2, 2026 20:4156,85628,898,80220,023,0001,014,0002,117,632stderr
2Jul 2, 2026 20:4156,87528,967,12420,027,0001,017,0002,117,632stderr
3Jul 2, 2026 20:4156,92428,867,61421,062,00002,117,632stderr
4Jul 2, 2026 20:4156,95428,716,39321,073,00002,117,632stderr
5Jul 2, 2026 20:4156,97528,961,75420,058,0001,023,0002,117,632stderr
6Jul 2, 2026 20:4156,98628,762,12720,075,0001,010,0002,117,632stderr
7Jul 2, 2026 20:4157,12929,002,78920,112,0001,026,0002,117,632stderr
8Jul 2, 2026 20:4157,31028,917,96720,089,0001,116,0002,117,632stderr
9Jul 2, 2026 20:41144,33561,232,87652,336,0001,068,0002,117,632stderr