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 30, 2026 07:46IlyaIlyaScore: 59,045Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 30, 2026 07:4758,70831,274,96420,617,0001,105,0002,113,536
2Jun 30, 2026 07:4758,83731,281,16320,591,0001,179,0002,113,536
3Jun 30, 2026 07:4758,97831,241,54320,657,0001,165,0002,113,536
4Jun 30, 2026 07:4759,00231,297,50820,714,0001,117,0002,113,536
5Jun 30, 2026 07:4759,04531,827,39220,639,0001,208,0002,113,536
6Jun 30, 2026 07:4759,12731,365,49020,697,0001,180,0002,113,536
7Jun 30, 2026 07:4759,20831,406,68020,708,0001,199,0002,113,536
8Jun 30, 2026 07:4759,28131,843,69520,723,0001,211,0002,113,536
9Jun 30, 2026 07:4759,28631,834,91220,715,0001,221,0002,113,536