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 10:27IlyaIlyaScore: 59,745Success
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 10:2859,59431,709,77720,921,0001,129,0002,113,536
2Jul 8, 2026 10:2859,61031,805,70120,933,0001,123,0002,113,536
3Jul 8, 2026 10:2859,64331,710,29120,934,0001,134,0002,113,536
4Jul 8, 2026 10:2859,70831,825,48720,948,0001,144,0002,113,536
5Jul 8, 2026 10:2859,74531,796,03120,978,0001,128,0002,113,536
6Jul 8, 2026 10:2859,75631,815,97221,002,0001,108,0002,113,536
7Jul 8, 2026 10:2859,78931,798,80520,982,0001,140,0002,113,536
8Jul 8, 2026 10:2859,80831,812,19321,001,0001,128,0002,113,536
9Jul 8, 2026 10:2859,80831,858,32520,993,0001,136,0002,113,536