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:15IlyaIlyaScore: 59,516Success
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:1959,37031,903,60220,746,0001,221,0002,113,536
2Jun 29, 2026 21:1959,44331,484,13620,805,0001,189,0002,113,536
3Jun 29, 2026 21:1959,49131,914,91020,811,0001,201,0002,113,536
4Jun 29, 2026 21:1959,50531,965,28720,814,0001,203,0002,113,536
5Jun 29, 2026 21:1959,51631,915,94620,824,0001,197,0002,113,536
6Jun 29, 2026 21:1959,62931,969,33420,844,0001,219,0002,113,536
7Jun 29, 2026 21:1959,70032,037,59720,846,0001,243,0002,113,536
8Jun 29, 2026 21:1959,75632,079,87320,901,0001,209,0002,113,536
9Jun 29, 2026 21:1959,75931,976,61720,872,0001,239,0002,113,536