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 listJul 3, 2026 13:00IlyaIlyaError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 3, 2026 13:03031,321,98420,701,0001,110,0002,113,536expected "429496501207 ", got "429496501414 "
2Jul 3, 2026 13:0359,01831,372,67620,638,0001,199,0002,113,536
3Jul 3, 2026 13:0359,07531,337,27720,726,0001,132,0002,113,536
4Jul 3, 2026 13:0359,15131,428,06120,738,0001,148,0002,113,536
5Jul 3, 2026 13:0359,27031,843,13420,728,0001,202,0002,113,536
6Jul 3, 2026 13:0359,28131,459,58520,745,0001,189,0002,113,536
7Jul 3, 2026 13:0359,33231,490,55820,750,0001,203,0002,113,536
8Jul 3, 2026 13:0359,40832,055,69820,733,0001,248,0002,113,536
9Jul 3, 2026 13:0359,63532,110,53020,837,0001,228,0002,113,536