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 listSep 20, 2026 15:03Andrew EpsteinAndrew EpsteinScore: 1,784,691Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 20, 2026 15:041,780,418669,931,099657,749,0001,006,0002,117,632stderr
2Sep 20, 2026 15:041,781,354670,228,962658,096,0001,005,0002,117,632stderr
3Sep 20, 2026 15:041,781,494670,400,050656,950,0002,203,0002,117,632stderr
4Sep 20, 2026 15:041,783,302672,557,476658,814,0001,008,0002,117,632stderr
5Sep 20, 2026 15:041,784,691671,369,986659,329,0001,007,0002,117,632stderr
6Sep 20, 2026 15:041,785,256671,704,457659,539,0001,006,0002,117,632stderr
7Sep 20, 2026 15:041,788,762672,914,362660,835,0001,007,0002,117,632stderr
8Sep 20, 2026 15:041,789,048672,329,714660,942,0001,006,0002,117,632stderr
9Sep 20, 2026 15:041,789,610673,253,755661,154,0001,002,0002,117,632stderr