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 listJul 10, 2026 21:41IlyaIlyaScore: 58,459Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 10, 2026 21:4358,19431,269,10020,430,0001,102,0002,113,536
2Jul 10, 2026 21:4358,24031,279,87820,452,0001,097,0002,113,536
3Jul 10, 2026 21:4358,35131,293,10520,468,0001,122,0002,113,536
4Jul 10, 2026 21:4358,37231,306,31020,488,0001,110,0002,113,536
5Jul 10, 2026 21:4358,45931,344,41220,512,0001,118,0002,113,536
6Jul 10, 2026 21:4358,57831,417,82620,525,0001,149,0002,113,536
7Jul 10, 2026 21:4321,577,2817,993,441,9397,833,311,000150,283,0002,113,536
8Jul 10, 2026 21:4321,668,1358,027,106,3427,866,667,000150,543,0002,113,536
9Jul 10, 2026 21:4321,739,0708,053,758,5567,892,644,000150,812,0002,113,536