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 listSep 6, 2026 15:34big blenderbig blenderScore: 22,407,240Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 6, 2026 15:3522,343,3058,277,297,6878,117,886,000149,137,0002,113,536
2Sep 6, 2026 15:3522,407,2408,301,451,9738,141,218,000149,461,0002,113,536
3Sep 6, 2026 15:3522,448,6108,317,013,4928,155,290,000150,696,0002,113,536