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 24, 2026 20:24Victor MerckléVictor MerckléScore: 70,348Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 24, 2026 20:2570,21035,059,73224,706,0001,272,0002,113,536
2Jun 24, 2026 20:2570,21335,050,57724,697,0001,282,0002,113,536
3Jun 24, 2026 20:2570,27835,113,33124,729,0001,274,0002,113,536
4Jun 24, 2026 20:2570,32935,163,13824,749,0001,273,0002,113,536
5Jun 24, 2026 20:2570,34835,142,61324,750,0001,279,0002,113,536
6Jun 24, 2026 20:2570,42435,210,73125,036,0001,021,0002,113,536
7Jun 24, 2026 20:2570,57535,185,74524,827,0001,286,0002,113,536
8Jun 24, 2026 20:2570,60835,208,85025,104,0001,021,0002,113,536
9Jun 24, 2026 20:2570,66735,284,49625,126,0001,021,0002,113,536