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:16Victor MerckléVictor MerckléScore: 57,067Success
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:1756,72128,884,91420,987,00002,117,632stderr
2Jul 2, 2026 20:1756,94028,761,77620,060,0001,008,0002,117,632stderr
3Jul 2, 2026 20:1756,98628,843,62220,032,0001,053,0002,117,632stderr
4Jul 2, 2026 20:1757,05929,389,29820,066,0001,046,0002,117,632stderr
5Jul 2, 2026 20:1757,06728,856,67420,053,0001,062,0002,117,632stderr
6Jul 2, 2026 20:1757,09428,868,03620,073,0001,052,0002,117,632stderr
7Jul 2, 2026 20:1757,10829,383,89620,095,0001,035,0002,117,632stderr
8Jul 2, 2026 20:1757,17529,021,99020,106,0001,049,0002,117,632stderr
9Jul 2, 2026 20:1757,20228,860,07220,099,0001,066,0002,117,632stderr