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 8, 2026 23:13IlyaIlyaScore: 58,383Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 8, 2026 23:1458,23531,218,35220,416,0001,131,0002,113,536
2Jul 8, 2026 23:1458,24031,188,44020,438,0001,111,0002,113,536
3Jul 8, 2026 23:1458,34031,281,51820,449,0001,137,0002,113,536
4Jul 8, 2026 23:1458,35131,169,52820,470,0001,120,0002,113,536
5Jul 8, 2026 23:1458,38331,286,50720,450,0001,152,0002,113,536
6Jul 8, 2026 23:1458,38631,220,86720,471,0001,132,0002,113,536
7Jul 8, 2026 23:1458,42931,532,50820,527,0001,092,0002,113,536
8Jul 8, 2026 23:1421,535,9727,978,248,3177,816,454,000151,856,0002,113,536
9Jul 8, 2026 23:1421,680,3248,031,770,9397,866,272,000155,448,0002,113,536