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 8, 2026 23:08IlyaIlyaScore: 21,471,737Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 8, 2026 23:1158,35131,324,42620,455,0001,135,0002,113,536
2Jul 8, 2026 23:1158,46231,321,48720,512,0001,119,0002,113,536
3Jul 8, 2026 23:1158,54331,844,00320,476,0001,185,0002,113,536
4Jul 8, 2026 23:1158,80531,959,44620,550,0001,208,0002,113,536
5Jul 8, 2026 23:1121,471,7377,954,923,5607,795,731,000148,812,0002,113,536
6Jul 8, 2026 23:1121,522,5277,973,826,1997,812,793,000150,542,0002,113,536
7Jul 8, 2026 23:1121,556,7277,986,127,1597,826,512,000149,477,0002,113,536
8Jul 8, 2026 23:1121,581,8027,995,356,4137,834,835,000150,432,0002,113,536
9Jul 8, 2026 23:1121,614,5298,007,773,3107,846,034,000151,342,0002,113,536