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 21:07IlyaIlyaScore: 59,075Success
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 21:0858,78131,376,40420,633,0001,116,0002,113,536
2Jul 8, 2026 21:0858,92931,447,62120,683,0001,121,0002,113,536
3Jul 8, 2026 21:0858,96231,415,10220,712,0001,104,0002,113,536
4Jul 8, 2026 21:0859,05631,488,78020,672,0001,179,0002,113,536
5Jul 8, 2026 21:0859,07531,422,83220,684,0001,174,0002,113,536
6Jul 8, 2026 21:0859,12931,487,78620,768,0001,110,0002,113,536
7Jul 8, 2026 21:0859,20031,649,78720,688,0001,216,0002,113,536
8Jul 8, 2026 21:0859,28631,609,77720,738,0001,198,0002,113,536
9Jul 8, 2026 21:0859,38631,632,39020,745,0001,228,0002,113,536