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 11, 2026 12:06Victor MerckléVictor MerckléScore: 63,462Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 11, 2026 12:0762,87230,685,94123,263,00002,113,536
2Jun 11, 2026 12:0763,10231,981,55623,348,00002,113,536
3Jun 11, 2026 12:0763,27830,831,42423,413,00002,113,536
4Jun 11, 2026 12:0763,36231,309,59523,444,00002,113,536
5Jun 11, 2026 12:0763,46230,868,77723,481,00002,113,536
6Jun 11, 2026 12:0763,46730,970,82223,483,00002,113,536
7Jun 11, 2026 12:0763,61330,964,75923,537,00002,113,536
8Jun 11, 2026 12:0763,72731,138,22122,573,0001,006,0002,113,536
9Jun 11, 2026 12:0763,97231,208,96623,670,00002,113,536