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 29, 2026 19:31IlyaIlyaScore: 60,597Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 29, 2026 19:3260,18631,761,17221,156,0001,113,0002,113,536
2Jun 29, 2026 19:3260,27031,820,75421,189,0001,111,0002,113,536
3Jun 29, 2026 19:3260,51031,908,53221,269,0001,120,0002,113,536
4Jun 29, 2026 19:3260,56231,878,06221,288,0001,120,0002,113,536
5Jun 29, 2026 19:3260,59732,268,93421,222,0001,199,0002,113,536
6Jun 29, 2026 19:3260,69432,745,44721,244,0001,213,0002,113,536
7Jun 29, 2026 19:3260,69432,332,52121,243,0001,214,0002,113,536
8Jun 29, 2026 19:3260,85132,452,99321,289,0001,226,0002,113,536
9Jun 29, 2026 19:3260,90233,755,68721,317,0001,217,0002,113,536