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 12, 2026 19:17IlyaIlyaScore: 58,697Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 12, 2026 19:1858,25931,237,88320,444,0001,112,0002,113,536
2Jul 12, 2026 19:1858,34331,168,15720,490,0001,097,0002,113,536
3Jul 12, 2026 19:1858,43231,364,86020,482,0001,138,0002,113,536
4Jul 12, 2026 19:1858,44531,166,90120,480,0001,145,0002,113,536
5Jul 12, 2026 19:1858,69732,009,50720,505,0001,213,0002,113,536
6Jul 12, 2026 19:1858,85432,038,26420,574,0001,202,0002,113,536
7Jul 12, 2026 19:1858,99431,812,99120,797,0001,031,0002,113,536
8Jul 12, 2026 19:1821,448,7057,946,307,3187,785,355,000150,666,0002,113,536
9Jul 12, 2026 19:1821,568,5377,990,327,9907,826,224,000154,135,0002,113,536