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 listApr 25, 2026 06:26Charles CabergsCharles CabergsScore: 70,981Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 25, 2026 06:2670,78140,999,97424,175,0002,014,0002,367,488
2Apr 25, 2026 06:2670,78144,862,55424,175,0002,014,0002,363,392
3Apr 25, 2026 06:2670,81046,390,64124,185,0002,015,0002,375,680
4Apr 25, 2026 06:2670,86742,220,74124,204,0002,017,0002,375,680
5Apr 25, 2026 06:2670,98143,734,02325,253,0001,010,0002,367,488
6Apr 25, 2026 06:2671,00046,515,63824,250,0002,020,0002,310,144
7Apr 25, 2026 06:2671,02439,552,19825,269,0001,010,0002,371,584
8Apr 25, 2026 06:2671,88939,358,15425,576,0001,023,0002,371,584
9Apr 25, 2026 06:2675,00844,910,73026,726,0001,027,0002,289,664