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 01:31Victor MerckléVictor MerckléScore: 58,510Success
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 01:3258,39429,017,13220,571,0001,035,0002,113,536
2Jun 25, 2026 01:3258,42929,068,25920,579,0001,040,0002,113,536
3Jun 25, 2026 01:3258,43730,898,48120,584,0001,038,0002,113,536
4Jun 25, 2026 01:3258,44829,067,52920,597,0001,029,0002,113,536
5Jun 25, 2026 01:3258,51029,319,23020,612,0001,037,0002,113,536
6Jun 25, 2026 01:3258,52429,075,24120,648,0001,006,0002,113,536
7Jun 25, 2026 01:3258,55929,329,23220,631,0001,036,0002,113,536
8Jun 25, 2026 01:3258,61029,341,82620,684,0001,002,0002,113,536
9Jun 25, 2026 01:3258,62129,355,93520,676,0001,014,0002,113,536