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 7, 2026 20:02Victor MerckléVictor MerckléScore: 71,732Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 20:0271,59434,490,40426,490,00002,117,632stderr
2Jul 7, 2026 20:0271,64534,336,26125,508,0001,001,0002,117,632stderr
3Jul 7, 2026 20:0271,66734,322,96625,498,0001,019,0002,117,632stderr
4Jul 7, 2026 20:0271,69134,927,13525,491,0001,035,0002,117,632stderr
5Jul 7, 2026 20:0271,73234,379,33925,512,0001,029,0002,117,632stderr
6Jul 7, 2026 20:0271,74034,384,07425,519,0001,025,0002,117,632stderr
7Jul 7, 2026 20:0271,84534,615,98925,565,0001,018,0002,117,632stderr
8Jul 7, 2026 20:0271,84834,632,67425,571,0001,013,0002,117,632stderr
9Jul 7, 2026 20:0272,08634,749,06825,597,0001,075,0002,117,632stderr