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 25, 2026 02:45Victor MerckléVictor MerckléScore: 58,305Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 25, 2026 02:4658,16729,108,42920,502,0001,020,0002,113,536
2Jun 25, 2026 02:4658,20029,060,34420,519,0001,015,0002,113,536
3Jun 25, 2026 02:4658,25929,184,09820,513,0001,043,0002,113,536
4Jun 25, 2026 02:4658,28929,125,24220,557,0001,010,0002,113,536
5Jun 25, 2026 02:4658,30529,141,14820,563,0001,010,0002,113,536
6Jun 25, 2026 02:4658,32729,029,04420,567,0001,014,0002,113,536
7Jun 25, 2026 02:4658,42129,128,19920,580,0001,036,0002,113,536
8Jun 25, 2026 02:4658,42429,551,54320,605,0001,012,0002,113,536
9Jun 25, 2026 02:4658,44329,151,44920,581,0001,043,0002,113,536