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 12, 2026 00:49Victor MerckléVictor MerckléScore: 65,021Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 12, 2026 00:5064,51633,068,92722,801,0001,070,0002,113,536
2May 12, 2026 00:5064,64535,342,76822,825,0001,094,0002,113,536
3May 12, 2026 00:5064,72432,701,79822,864,0001,084,0002,113,536
4May 12, 2026 00:5064,72433,466,99922,864,0001,084,0002,113,536
5May 12, 2026 00:5065,02133,278,18122,997,0001,061,0002,113,536
6May 12, 2026 00:5065,05134,582,09522,987,0001,082,0002,113,536
7May 12, 2026 00:5065,05932,824,43922,906,0001,166,0002,113,536
8May 12, 2026 00:5065,14034,231,25922,997,0001,105,0002,113,536
9May 12, 2026 00:5065,14836,163,41223,000,0001,105,0002,113,536