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 30, 2026 09:22olliecrowolliecrowScore: 66,994Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 30, 2026 09:2366,83747,267,17222,670,0002,060,0002,523,136
2Apr 30, 2026 09:2366,83742,560,22122,670,0002,060,0002,342,912
3Apr 30, 2026 09:2366,85948,456,10321,770,0002,968,0002,523,136
4Apr 30, 2026 09:2366,93540,145,79822,703,0002,063,0002,531,328
5Apr 30, 2026 09:2366,99441,327,36221,814,0002,974,0002,322,432
6Apr 30, 2026 09:2367,06245,325,36021,836,0002,977,0002,527,232
7Apr 30, 2026 09:2367,15643,960,62421,867,0002,981,0002,514,944
8Apr 30, 2026 09:2367,18636,239,32222,871,0001,988,0002,338,816
9Apr 30, 2026 09:2369,35634,192,59023,609,0002,053,0002,437,120