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 listMay 12, 2026 00:15Victor MerckléVictor MerckléScore: 64,656Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 12, 2026 00:1664,30232,767,11222,775,0001,017,0002,113,536
2May 12, 2026 00:1664,33234,536,48222,801,0001,002,0002,113,536
3May 12, 2026 00:1664,49732,627,61522,785,0001,079,0002,113,536
4May 12, 2026 00:1664,60833,719,58922,828,0001,077,0002,113,536
5May 12, 2026 00:1664,65634,490,39422,807,0001,116,0002,113,536
6May 12, 2026 00:1664,86732,761,34022,883,0001,118,0002,113,536
7May 12, 2026 00:1665,01834,943,87222,960,0001,097,0002,113,536
8May 12, 2026 00:1665,02434,598,80322,945,0001,114,0002,113,536
9May 12, 2026 00:1665,15633,387,56822,988,0001,120,0002,113,536