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 07:42e1011e1011Score: 86,337Success
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 07:4585,95942,704,39330,603,0001,202,0002,113,536
2Oct 20, 2026 07:4586,07843,293,23630,743,0001,106,0002,113,536
3Oct 20, 2026 07:4586,09443,300,83430,654,0001,201,0002,113,536
4Oct 20, 2026 07:4586,12455,075,78530,652,0001,214,0002,113,536
5Oct 20, 2026 07:4586,33742,886,55130,743,0001,202,0002,113,536
6Oct 20, 2026 07:4586,54543,480,10830,819,0001,203,0002,113,536
7Oct 20, 2026 07:4587,81343,705,47131,293,0001,198,0002,113,536
8Oct 20, 2026 07:4596,60549,720,98834,489,0001,255,0002,113,536
9Oct 20, 2026 07:4597,03748,470,26834,781,0001,123,0002,113,536