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 listMay 11, 2026 16:16Victor MerckléVictor MerckléScore: 68,181Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 16:1767,98936,851,51923,939,0001,217,0002,113,536
2May 11, 2026 16:1767,99133,851,35323,933,0001,224,0002,113,536
3May 11, 2026 16:1768,06233,840,82123,980,0001,203,0002,113,536
4May 11, 2026 16:1768,12434,267,50524,000,0001,206,0002,113,536
5May 11, 2026 16:1768,18133,810,26424,016,0001,211,0002,113,536
6May 11, 2026 16:1768,21633,909,48024,041,0001,199,0002,113,536
7May 11, 2026 16:1768,55434,125,21824,182,0001,183,0002,113,536
8May 11, 2026 16:1768,55634,778,72824,143,0001,223,0002,113,536
9May 11, 2026 16:1768,59134,639,93324,202,0001,177,0002,113,536