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 06:39e1011e1011Score: 209,178Success
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 06:42189,88981,188,14667,077,0003,182,0002,113,536
2Oct 20, 2026 06:42191,10581,626,17467,171,0003,538,0002,113,536
3Oct 20, 2026 06:42205,24386,801,16467,184,0008,756,00020,480
4Oct 20, 2026 06:42208,07287,850,90567,702,0009,285,0002,113,536
5Oct 20, 2026 06:42209,17888,795,37376,236,0001,160,0002,113,536
6Oct 20, 2026 06:42211,31089,602,54167,279,00010,906,0002,113,536
7Oct 20, 2026 06:42214,45990,244,64675,604,0003,746,0002,113,536
8Oct 20, 2026 06:42219,07592,001,02867,331,00013,727,0002,113,536
9Oct 20, 2026 06:42219,20291,975,76970,035,00011,070,0002,113,536