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 10, 2026 16:25Victor MerckléVictor MerckléScore: 63,267Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 10, 2026 16:2662,50830,493,86523,128,00002,113,536
2Jun 10, 2026 16:2662,97531,220,31023,301,00002,113,536
3Jun 10, 2026 16:2663,06430,855,52523,334,00002,113,536
4Jun 10, 2026 16:2663,25130,761,57323,403,00002,113,536
5Jun 10, 2026 16:2663,26730,774,80823,409,00002,113,536
6Jun 10, 2026 16:2663,27030,892,56623,410,00002,113,536
7Jun 10, 2026 16:2663,40230,939,31623,459,00002,113,536
8Jun 10, 2026 16:2663,45431,382,45623,478,00002,113,536
9Jun 10, 2026 16:2663,65432,541,55323,552,00002,113,536