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 18:47Victor MerckléVictor MerckléScore: 77,491Success
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 18:4877,01337,572,54227,411,0001,084,0002,113,536
2Jun 24, 2026 18:4877,08637,646,78327,423,0001,099,0002,113,536
3Jun 24, 2026 18:4877,18637,667,45327,483,0001,076,0002,113,536
4Jun 24, 2026 18:4877,45437,747,21927,624,0001,034,0002,113,536
5Jun 24, 2026 18:4877,49137,765,32727,570,0001,102,0002,113,536
6Jun 24, 2026 18:4877,49437,779,50027,568,0001,105,0002,113,536
7Jun 24, 2026 18:4877,63737,873,91927,606,0001,120,0002,113,536
8Jun 24, 2026 18:4877,66237,880,65827,629,0001,106,0002,113,536
9Jun 24, 2026 18:4877,66437,877,33627,656,0001,080,0002,113,536