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 25, 2026 04:33Victor MerckléVictor MerckléScore: 58,245Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 25, 2026 04:3458,11829,139,35820,478,0001,026,0002,113,536
2Jun 25, 2026 04:3458,12728,948,72621,507,00002,113,536
3Jun 25, 2026 04:3458,17030,314,99920,513,0001,010,0002,113,536
4Jun 25, 2026 04:3458,22728,992,35620,516,0001,028,0002,113,536
5Jun 25, 2026 04:3458,24529,315,53920,523,0001,028,0002,113,536
6Jun 25, 2026 04:3458,25428,997,06220,527,0001,027,0002,113,536
7Jun 25, 2026 04:3458,32129,033,78320,547,0001,032,0002,113,536
8Jun 25, 2026 04:3458,34829,076,84120,552,0001,037,0002,113,536
9Jun 25, 2026 04:3458,44329,519,44120,584,0001,040,0002,113,536