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 listJun 29, 2026 21:33IlyaIlyaScore: 59,781Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 29, 2026 21:3559,52931,506,14620,889,0001,137,0002,113,536
2Jun 29, 2026 21:3559,57831,501,13120,864,0001,180,0002,113,536
3Jun 29, 2026 21:3559,64831,558,79120,965,0001,105,0002,113,536
4Jun 29, 2026 21:3559,74032,029,17020,914,0001,190,0002,113,536
5Jun 29, 2026 21:3559,78132,152,03620,999,0001,120,0002,113,536
6Jun 29, 2026 21:3559,84531,834,73520,949,0001,194,0002,113,536
7Jun 29, 2026 21:3559,92932,064,61020,999,0001,175,0002,113,536
8Jun 29, 2026 21:3559,98332,151,03420,988,0001,206,0002,113,536
9Jun 29, 2026 21:3559,99132,081,32220,991,0001,206,0002,113,536