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 2, 2026 11:59IlyaIlyaScore: 59,578Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 2, 2026 12:0059,26432,695,03820,823,0001,105,0002,113,536
2Jul 2, 2026 12:0059,32431,516,23220,827,0001,123,0002,113,536
3Jul 2, 2026 12:0059,39731,461,61520,799,0001,178,0002,113,536
4Jul 2, 2026 12:0059,52432,003,74420,832,0001,192,0002,113,536
5Jul 2, 2026 12:0059,57831,556,44920,902,0001,142,0002,113,536
6Jul 2, 2026 12:0059,63232,007,14120,862,0001,202,0002,113,536
7Jul 2, 2026 12:0059,68131,735,44120,903,0001,179,0002,113,536
8Jul 2, 2026 12:0059,72732,056,13220,892,0001,207,0002,113,536
9Jul 2, 2026 12:0059,76431,632,25620,903,0001,210,0002,113,536