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, 2025 05:18Steve BronderSteve BronderScore: 70,949Success
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, 2025 05:1870,70847,208,08824,150,0002,012,0002,531,328
2Apr 21, 2025 05:1870,73851,749,16525,167,0001,006,0002,433,024
3Apr 21, 2025 05:1870,91147,806,25025,228,0001,009,0002,424,832
4Apr 21, 2025 05:1870,93245,190,49523,217,0003,028,0002,527,232
5Apr 21, 2025 05:1870,94953,625,21323,222,0003,029,0002,433,024
6Apr 21, 2025 05:1870,99549,074,56724,248,0002,020,0002,531,328
7Apr 21, 2025 05:1871,30845,450,17525,370,0001,014,0002,519,040
8Apr 21, 2025 05:1871,31147,369,55725,371,0001,014,0002,531,328
9Apr 21, 2025 05:1871,44349,116,67825,418,0001,016,0002,437,120