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 8, 2026 01:27Victor MerckléVictor MerckléScore: 64,132Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 8, 2026 01:2863,92132,732,74522,508,0001,143,0002,113,536
2Jun 8, 2026 01:2863,95432,755,23422,575,0001,088,0002,113,536
3Jun 8, 2026 01:2864,01832,773,19922,543,0001,144,0002,113,536
4Jun 8, 2026 01:2864,02432,899,58322,532,0001,157,0002,113,536
5Jun 8, 2026 01:2864,13232,879,46322,572,0001,157,0002,113,536
6Jun 8, 2026 01:2864,24832,842,15822,718,0001,054,0002,113,536
7Jun 8, 2026 01:2864,27532,971,61822,714,0001,068,0002,113,536
8Jun 8, 2026 01:2864,29132,879,25722,716,0001,072,0002,113,536
9Jun 8, 2026 01:2864,50232,991,83722,722,0001,144,0002,113,536