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 17, 2026 04:41Josu San MartinJosu San MartinScore: 68,119Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 17, 2026 04:4167,82448,707,45823,088,0002,007,0002,277,376
2Jan 17, 2026 04:4167,94346,686,29424,134,0001,005,0002,379,776
3Jan 17, 2026 04:4167,99746,975,58624,153,0001,006,0002,379,776
4Jan 17, 2026 04:4168,08650,131,32524,185,0001,007,0002,277,376
5Jan 17, 2026 04:4168,11951,820,41424,196,0001,008,0002,277,376
6Jan 17, 2026 04:4168,25948,249,73324,246,0001,010,0002,396,160
7Jan 17, 2026 04:4168,47858,125,34825,337,00002,277,376
8Jan 17, 2026 04:4168,58949,360,22525,378,00002,392,064
9Jan 17, 2026 04:4168,64350,941,27425,398,00002,383,872