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 listJan 12, 2026 04:23Josu San MartinJosu San MartinScore: 71,397Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 12, 2026 04:2370,86250,203,05725,211,0001,008,0002,371,584
2Jan 12, 2026 04:2371,11651,134,38424,289,0002,024,0002,289,664
3Jan 12, 2026 04:2371,16247,732,03825,318,0001,012,0002,351,104
4Jan 12, 2026 04:2371,25948,164,24725,352,0001,014,0002,289,664
5Jan 12, 2026 04:2371,39749,180,23825,401,0001,016,0002,363,392
6Jan 12, 2026 04:2371,44151,765,19325,417,0001,016,0002,363,392
7Jan 12, 2026 04:2371,46549,337,99226,442,00002,289,664
8Jan 12, 2026 04:2371,59748,580,27325,473,0001,018,0002,289,664
9Jan 12, 2026 04:2371,88153,035,70625,574,0001,022,0002,289,664