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 listMar 3, 2026 12:54NoSIMD_C#NoSIMD_C#Score: 167,657Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 3, 2026 12:54167,11689,343,32959,839,0001,994,0002,551,808
2Mar 3, 2026 12:54167,17688,588,72258,862,0002,993,0002,293,760
3Mar 3, 2026 12:54167,31991,484,03859,911,0001,997,0002,293,760
4Mar 3, 2026 12:54167,64186,378,24259,026,0003,001,0002,306,048
5Mar 3, 2026 12:54167,65790,929,76659,032,0003,001,0002,539,520
6Mar 3, 2026 12:54167,79286,667,22659,079,0003,004,0002,555,904
7Mar 3, 2026 12:54167,94689,293,16759,134,0003,006,0002,306,048
8Mar 3, 2026 12:54168,01694,381,93660,161,0002,005,0002,293,760
9Mar 3, 2026 12:54168,27090,420,86860,252,0002,008,0002,306,048