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 25, 2026 18:31IlyaIlyaScore: 77,270Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 25, 2026 18:3276,57037,665,93327,133,0001,198,0002,113,536
2Jun 25, 2026 18:3276,81838,175,88527,200,0001,223,0002,113,536
3Jun 25, 2026 18:3276,91838,157,50127,245,0001,215,0002,113,536
4Jun 25, 2026 18:3276,96238,184,79827,255,0001,221,0002,113,536
5Jun 25, 2026 18:3277,27038,262,34627,379,0001,211,0002,113,536
6Jun 25, 2026 18:3277,38938,284,26127,403,0001,231,0002,113,536
7Jun 25, 2026 18:3279,10847,329,72328,017,0001,253,0002,113,536
8Jun 25, 2026 18:3281,56449,849,24428,886,0001,293,0002,117,632
9Jun 25, 2026 18:3281,77245,379,05129,086,0001,170,0002,113,536