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 listOct 20, 2026 08:16e1011e1011Score: 148,818Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 20, 2026 08:19148,53567,622,88353,844,0001,114,0002,113,536
2Oct 20, 2026 08:19148,61665,895,99053,880,0001,108,0002,113,536
3Oct 20, 2026 08:19148,63766,403,71753,805,0001,191,0002,113,536
4Oct 20, 2026 08:19148,65965,830,55553,905,0001,099,0002,113,536
5Oct 20, 2026 08:19148,81865,958,38353,931,0001,132,0002,113,536
6Oct 20, 2026 08:19149,20066,712,35453,987,0001,217,0002,113,536
7Oct 20, 2026 08:19149,25966,164,97754,044,0001,182,0002,113,536
8Oct 20, 2026 08:19160,35470,317,80858,147,0001,184,0002,113,536
9Oct 20, 2026 08:19160,43770,399,37358,154,0001,208,0002,113,536