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 21, 2026 18:36M-RochatM-RochatScore: 59,543Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 21, 2026 18:3759,30033,534,28620,878,0001,063,0002,113,536
2May 21, 2026 18:3759,32733,568,78320,878,0001,073,0002,113,536
3May 21, 2026 18:3759,45432,559,41420,927,0001,071,0002,113,536
4May 21, 2026 18:3759,47032,119,18420,865,0001,139,0002,113,536
5May 21, 2026 18:3759,54332,904,05220,884,0001,147,0002,113,536
6May 21, 2026 18:3759,55632,408,64920,879,0001,157,0002,113,536
7May 21, 2026 18:3759,60832,066,30820,984,0001,071,0002,113,536
8May 21, 2026 18:3759,61631,750,77120,969,0001,089,0002,113,536
9May 21, 2026 18:3759,71333,545,03320,936,0001,158,0002,113,536