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 2, 2026 21:02Victor MerckléVictor MerckléScore: 56,972Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 2, 2026 21:0456,87228,969,96720,022,0001,021,0002,117,632stderr
2Jul 2, 2026 21:0456,87228,934,18420,028,0001,015,0002,117,632stderr
3Jul 2, 2026 21:0456,89428,950,77520,050,0001,001,0002,117,632stderr
4Jul 2, 2026 21:0456,95928,781,80621,075,00002,117,632stderr
5Jul 2, 2026 21:0456,97228,785,22820,063,0001,017,0002,117,632stderr
6Jul 2, 2026 21:0457,00230,493,66220,069,0001,022,0002,117,632stderr
7Jul 2, 2026 21:0457,02129,333,04020,055,0001,043,0002,117,632stderr
8Jul 2, 2026 21:0457,10029,150,74320,109,0001,018,0002,117,632stderr
9Jul 2, 2026 21:0457,11629,416,63120,088,0001,045,0002,117,632stderr