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 6, 2026 09:57Victor MerckléVictor MerckléScore: 64,532Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 6, 2026 09:5864,12432,884,08422,666,0001,060,0002,113,536
2Jun 6, 2026 09:5864,28132,851,16522,726,0001,058,0002,113,536
3Jun 6, 2026 09:5864,38132,978,00522,687,0001,134,0002,113,536
4Jun 6, 2026 09:5864,38132,957,72722,673,0001,148,0002,113,536
5Jun 6, 2026 09:5864,53232,996,29022,741,0001,136,0002,113,536
6Jun 6, 2026 09:5864,57033,031,91022,745,0001,146,0002,113,536
7Jun 6, 2026 09:5864,70033,027,67522,861,0001,078,0002,113,536
8Jun 6, 2026 09:5864,89734,985,32522,856,0001,156,0002,113,536
9Jun 6, 2026 09:5864,93733,129,61522,878,0001,149,0002,113,536