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 16:38Victor MerckléVictor MerckléScore: 57,981Success
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 16:3957,91030,509,40720,401,0001,026,0002,113,536
2Aug 28, 2026 16:3957,91629,543,13621,429,00002,113,536
3Aug 28, 2026 16:3957,96430,530,54820,408,0001,039,0002,113,536
4Aug 28, 2026 16:3957,96729,829,63620,446,0001,002,0002,113,536
5Aug 28, 2026 16:3957,98130,566,39720,451,0001,002,0002,113,536
6Aug 28, 2026 16:3958,00529,618,50220,445,0001,017,0002,113,536
7Aug 28, 2026 16:3958,10529,786,61821,499,00002,113,536
8Aug 28, 2026 16:3958,19129,694,31520,486,0001,045,0002,113,536
9Aug 28, 2026 16:3958,24830,710,04520,518,0001,034,0002,113,536