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:28IlyaIlyaScore: 58,775Success
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:3558,35631,214,28820,476,0001,116,0002,113,536
2Jul 8, 2026 23:3558,46731,245,42120,516,0001,117,0002,113,536
3Jul 8, 2026 23:3558,60031,336,12120,527,0001,155,0002,113,536
4Jul 8, 2026 23:3558,75131,443,63020,560,0001,178,0002,113,536
5Jul 8, 2026 23:3558,77532,003,95220,532,0001,215,0002,113,536
6Jul 8, 2026 23:3558,94032,095,25820,590,0001,218,0002,113,536
7Jul 8, 2026 23:3521,232,7547,866,045,0537,702,771,000153,348,0002,113,536
8Jul 8, 2026 23:3521,366,4517,915,711,2687,750,438,000155,149,0002,113,536
9Jul 8, 2026 23:3521,410,2277,931,649,6067,770,757,000151,027,0002,113,536