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 5, 2026 07:58olliecrowolliecrowScore: 60,894Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 5, 2026 07:5960,04840,168,25321,061,0001,157,0002,383,872
2May 5, 2026 07:5960,18637,819,52421,200,0001,069,0002,392,064
3May 5, 2026 07:5960,71340,883,09321,405,0001,059,0002,392,064
4May 5, 2026 07:5960,77839,018,32521,416,0001,072,0002,392,064
5May 5, 2026 07:5960,89437,322,08621,427,0001,104,0002,392,064
6May 5, 2026 07:5960,95140,307,82321,489,0001,063,0002,383,872
7May 5, 2026 07:5961,10840,333,99521,497,0001,113,0002,383,872
8May 5, 2026 07:5961,22441,362,69121,428,0001,225,0002,367,488
9May 5, 2026 07:5968,90053,625,07724,321,0001,172,0002,375,680