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 30, 2026 22:25IlyaIlyaScore: 61,937Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 30, 2026 22:2661,58932,283,03321,696,0001,092,0002,113,536
2Jun 30, 2026 22:2661,72932,293,40221,731,0001,109,0002,113,536
3Jun 30, 2026 22:2661,82432,331,61421,781,0001,094,0002,113,536
4Jun 30, 2026 22:2661,90032,348,00621,791,0001,112,0002,117,632
5Jun 30, 2026 22:2661,93732,362,44821,799,0001,118,0002,113,536
6Jun 30, 2026 22:2662,00032,884,67021,714,0001,226,0002,113,536
7Jun 30, 2026 22:2662,34332,609,63321,924,0001,143,0002,113,536
8Jun 30, 2026 22:2662,56733,148,65921,932,0001,218,0002,113,536
9Jun 30, 2026 22:2662,90833,247,00322,065,0001,211,0002,113,536