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 07:09IlyaIlyaScore: 60,767Success
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 07:1360,56431,939,27221,302,0001,107,0002,113,536
2Jul 3, 2026 07:1360,65632,061,83521,271,0001,172,0002,113,536
3Jul 3, 2026 07:1360,71031,932,16921,327,0001,136,0002,113,536
4Jul 3, 2026 07:1360,74031,980,60021,351,0001,123,0002,113,536
5Jul 3, 2026 07:1360,76731,990,41821,354,0001,130,0002,113,536
6Jul 3, 2026 07:1360,84332,062,86921,366,0001,146,0002,113,536
7Jul 3, 2026 07:1360,87232,427,69921,383,0001,140,0002,113,536
8Jul 3, 2026 07:1360,97232,581,86821,343,0001,217,0002,113,536
9Jul 3, 2026 07:1361,19132,639,88621,418,0001,223,0002,113,536