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 3, 2026 13:31IlyaIlyaScore: 61,378Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 3, 2026 13:3561,09732,049,51221,482,0001,124,0002,113,536
2Jul 3, 2026 13:3561,13732,151,42921,502,0001,119,0002,113,536
3Jul 3, 2026 13:3561,20532,130,03521,523,0001,123,0002,113,536
4Jul 3, 2026 13:3561,34532,739,97721,520,0001,178,0002,113,536
5Jul 3, 2026 13:3561,37832,117,93821,513,0001,197,0002,113,536
6Jul 3, 2026 13:3561,49732,788,76721,536,0001,218,0002,113,536
7Jul 3, 2026 13:3561,52432,253,27021,644,0001,120,0002,113,536
8Jul 3, 2026 13:3561,74832,838,59821,663,0001,184,0002,113,536
9Jul 3, 2026 13:3561,86732,839,53821,671,0001,220,0002,113,536