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 listAug 28, 2026 15:40Victor MerckléVictor MerckléScore: 57,327Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 28, 2026 15:4157,22930,182,19420,151,0001,024,0002,113,536
2Aug 28, 2026 15:4157,26730,257,60620,178,0001,011,0002,113,536
3Aug 28, 2026 15:4157,31629,393,91320,194,0001,013,0002,113,536
4Aug 28, 2026 15:4157,32129,588,93420,188,0001,021,0002,113,536
5Aug 28, 2026 15:4157,32729,453,71720,185,0001,026,0002,113,536
6Aug 28, 2026 15:4157,35129,418,46720,212,0001,008,0002,113,536
7Aug 28, 2026 15:4157,36230,327,70220,187,0001,037,0002,113,536
8Aug 28, 2026 15:4157,38329,423,30120,199,0001,033,0002,113,536
9Aug 28, 2026 15:4157,38329,505,19420,229,0001,003,0002,113,536