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 19:20Victor MerckléVictor MerckléScore: 56,810Success
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 19:2156,68928,766,70719,957,0001,018,0002,113,536
2Jul 7, 2026 19:2156,70528,966,42620,981,00002,113,536
3Jul 7, 2026 19:2156,73228,932,97619,982,0001,009,0002,113,536
4Jul 7, 2026 19:2156,80528,853,32220,005,0001,013,0002,113,536
5Jul 7, 2026 19:2156,81029,283,40619,999,0001,021,0002,113,536
6Jul 7, 2026 19:2156,83229,048,01520,010,0001,018,0002,113,536
7Jul 7, 2026 19:2156,89428,979,90220,022,0001,029,0002,113,536
8Jul 7, 2026 19:2156,92729,490,51420,019,0001,044,0002,113,536
9Jul 7, 2026 19:2156,95628,905,46320,037,0001,037,0002,113,536