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 16, 2026 23:35janwwwjanwwwScore: 65,854Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 16, 2026 23:3865,50234,680,04022,165,0002,071,0002,170,880
2Oct 16, 2026 23:3865,56734,692,09923,138,0001,122,0002,129,920
3Oct 16, 2026 23:3865,71834,758,06923,177,0001,139,0002,129,920
4Oct 16, 2026 23:3865,73534,751,40023,183,0001,139,0002,129,920
5Oct 16, 2026 23:3865,85434,768,07122,241,0002,125,0002,170,880
6Oct 16, 2026 23:3865,98334,891,38423,282,0001,132,0002,129,920
7Oct 16, 2026 23:3865,98635,012,16823,296,0001,119,0002,129,920
8Oct 16, 2026 23:3866,04835,074,76822,339,0002,099,0002,170,880
9Oct 16, 2026 23:3866,05634,837,89423,329,0001,112,0002,129,920