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 6, 2026 17:21IlyaIlyaScore: 59,191Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 17:2258,92931,369,60920,668,0001,136,0002,113,536
2Jul 6, 2026 17:2258,94331,362,36620,683,0001,126,0002,113,536
3Jul 6, 2026 17:2259,14831,488,85220,750,0001,135,0002,117,632
4Jul 6, 2026 17:2259,16431,473,69220,700,0001,191,0002,113,536
5Jul 6, 2026 17:2259,19132,142,54720,691,0001,210,0002,113,536
6Jul 6, 2026 17:2259,30031,567,94820,751,0001,190,0002,113,536
7Jul 6, 2026 17:2259,31032,167,97020,718,0001,227,0002,113,536
8Jul 6, 2026 17:2259,36732,094,05820,752,0001,214,0002,113,536
9Jul 6, 2026 17:2259,43731,714,04420,960,0001,032,0002,113,536