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 09:30e1011e1011Score: 85,154Success
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 09:3183,72441,920,99129,875,0001,103,0002,113,536
2Oct 20, 2026 09:3183,92442,604,82729,846,0001,206,0002,113,536
3Oct 20, 2026 09:3184,10542,031,81529,924,0001,195,0002,113,536
4Oct 20, 2026 09:3184,60842,702,70130,106,0001,199,0002,113,536
5Oct 20, 2026 09:3185,15442,429,53830,326,0001,181,0002,113,536
6Oct 20, 2026 09:3185,18942,449,57030,330,0001,190,0002,113,536
7Oct 20, 2026 09:3195,45146,798,44534,118,0001,199,0002,113,536
8Oct 20, 2026 09:3196,38346,670,85734,439,0001,223,0002,113,536
9Oct 20, 2026 09:3197,26746,910,31634,865,0001,124,0002,113,536