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 17, 2026 23:07Victor MerckléVictor MerckléScore: 63,959Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 17, 2026 23:0863,25630,899,67623,405,00002,113,536
2Jun 17, 2026 23:0863,31830,831,55123,428,00002,113,536
3Jun 17, 2026 23:0863,74331,210,76523,585,00002,113,536
4Jun 17, 2026 23:0863,95431,572,34523,663,00002,113,536
5Jun 17, 2026 23:0863,95931,677,06923,665,00002,113,536
6Jun 17, 2026 23:0864,15631,382,73623,738,00002,113,536
7Jun 17, 2026 23:0864,20232,453,37623,755,00002,113,536
8Jun 17, 2026 23:0864,30831,771,61623,794,00002,113,536
9Jun 17, 2026 23:0864,92731,577,10422,962,0001,061,0002,113,536