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 24, 2026 14:54Victor MerckléVictor MerckléScore: 63,270Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 24, 2026 14:5462,88630,805,35523,268,00002,113,536
2Jun 24, 2026 14:5463,11330,905,97023,352,00002,113,536
3Jun 24, 2026 14:5463,20830,898,13923,387,00002,113,536
4Jun 24, 2026 14:5463,21330,962,11923,389,00002,113,536
5Jun 24, 2026 14:5463,27030,983,46622,381,0001,029,0002,113,536
6Jun 24, 2026 14:5463,41631,116,39423,464,00002,113,536
7Jun 24, 2026 14:5463,64331,095,50623,548,00002,113,536
8Jun 24, 2026 14:5463,89731,248,63123,642,00002,113,536
9Jun 24, 2026 14:5464,09731,289,14523,716,00002,113,536