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: 72,557Success
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:2372,08452,967,76226,671,00002,359,296
2Jan 12, 2026 04:2372,47649,987,39624,830,0001,986,0002,289,664
3Jan 12, 2026 04:2372,53056,071,99025,843,000993,0002,289,664
4Jan 12, 2026 04:2372,53850,612,50426,839,00002,289,664
5Jan 12, 2026 04:2372,55752,899,51625,852,000994,0002,375,680
6Jan 12, 2026 04:2372,55955,899,17925,853,000994,0002,355,200
7Jan 12, 2026 04:2372,56853,257,22925,856,000994,0002,289,664
8Jan 12, 2026 04:2372,58951,255,18925,864,000994,0002,289,664
9Jan 12, 2026 04:2372,66555,989,93724,895,0001,991,0002,289,664