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 6, 2026 07:43olliecrowolliecrowScore: 59,786Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 6, 2026 07:4359,56436,342,45120,902,0001,137,0002,392,064
2May 6, 2026 07:4359,61640,147,67720,901,0001,157,0002,387,968
3May 6, 2026 07:4359,63538,215,78320,917,0001,148,0002,383,872
4May 6, 2026 07:4359,77236,323,15720,931,0001,185,0002,379,776
5May 6, 2026 07:4359,78639,765,97521,048,0001,073,0002,383,872
6May 6, 2026 07:4359,80241,976,47620,974,0001,153,0002,383,872
7May 6, 2026 07:4359,80539,060,77020,984,0001,144,0002,387,968
8May 6, 2026 07:4359,89140,387,80120,990,0001,170,0002,392,064
9May 6, 2026 07:4360,05642,586,39221,138,0001,083,0002,387,968