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 listMay 17, 2026 11:56M-RochatM-RochatScore: 61,502Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 11:5861,19433,865,28621,627,0001,015,0002,113,536
2May 17, 2026 11:5861,30231,484,49621,669,0001,013,0002,113,536
3May 17, 2026 11:5861,42431,552,40421,634,0001,093,0002,113,536
4May 17, 2026 11:5861,46731,535,06021,661,0001,082,0002,113,536
5May 17, 2026 11:5861,50232,056,15221,662,0001,094,0002,113,536
6May 17, 2026 11:5861,55433,225,61821,766,0001,009,0002,113,536
7May 17, 2026 11:5861,55631,653,52421,681,0001,095,0002,113,536
8May 17, 2026 11:5861,70231,869,80721,738,0001,092,0002,113,536
9May 17, 2026 11:5861,81332,361,25921,776,0001,095,0002,113,536