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 21, 2026 00:00olliecrowolliecrowScore: 62,567Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 21, 2026 00:0162,28152,205,39721,041,0002,003,0002,498,560
2Apr 21, 2026 00:0162,37247,221,89421,072,0002,006,0002,498,560
3Apr 21, 2026 00:0162,51348,479,83821,119,0002,011,0002,281,472
4Apr 21, 2026 00:0162,55645,568,99221,134,0002,012,0002,498,560
5Apr 21, 2026 00:0162,56747,183,46621,137,0002,013,0002,494,464
6Apr 21, 2026 00:0162,57049,481,27420,132,0003,019,0002,490,368
7Apr 21, 2026 00:0162,59748,692,26520,140,0003,021,0002,494,464
8Apr 21, 2026 00:0162,67053,523,46121,172,0002,016,0002,494,464
9Apr 21, 2026 00:0162,74348,506,31820,187,0003,028,0002,490,368