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 1, 2026 13:50IlyaIlyaScore: 62,027Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 1, 2026 13:5261,67532,298,98221,645,0001,175,0002,113,536
2Jul 1, 2026 13:5261,75132,310,50521,741,0001,107,0002,113,536
3Jul 1, 2026 13:5261,75432,931,20321,659,0001,190,0002,113,536
4Jul 1, 2026 13:5261,87532,848,31221,703,0001,191,0002,113,536
5Jul 1, 2026 13:5262,02732,495,40521,751,0001,199,0002,113,536
6Jul 1, 2026 13:5262,02932,935,79321,768,0001,183,0002,113,536
7Jul 1, 2026 13:5221,532,3027,976,676,7327,811,128,000155,824,0002,113,536
8Jul 1, 2026 13:5221,625,4628,011,140,9667,844,164,000157,257,0002,113,536
9Jul 1, 2026 13:5221,629,1788,014,562,6417,848,620,000154,176,0002,113,536