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 10:37IlyaIlyaScore: 62,378Success
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 10:3862,05632,451,32521,850,0001,111,0002,113,536
2Jun 30, 2026 10:3862,12932,480,90521,870,0001,118,0002,113,536
3Jun 30, 2026 10:3862,13532,472,43321,873,0001,117,0002,113,536
4Jun 30, 2026 10:3862,18332,517,51121,914,0001,094,0002,113,536
5Jun 30, 2026 10:3862,37832,970,26521,851,0001,229,0002,113,536
6Jun 30, 2026 10:3862,43533,393,19321,889,0001,212,0002,113,536
7Jun 30, 2026 10:3862,45432,602,48421,988,0001,120,0002,113,536
8Jun 30, 2026 10:3862,46433,033,46421,888,0001,224,0002,113,536
9Jun 30, 2026 10:3862,54833,110,97021,903,0001,240,0002,113,536