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 17:10Victor MerckléVictor MerckléScore: 63,229Success
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 17:1162,65630,696,11922,181,0001,002,0002,113,536
2Jun 24, 2026 17:1162,66730,814,59523,187,00002,113,536
3Jun 24, 2026 17:1162,67030,820,33323,188,00002,113,536
4Jun 24, 2026 17:1163,05130,990,54222,329,0001,000,0002,113,536
5Jun 24, 2026 17:1163,22930,849,29723,395,00002,113,536
6Jun 24, 2026 17:1163,37031,336,85723,447,00002,113,536
7Jun 24, 2026 17:1163,57531,189,00023,523,00002,113,536
8Jun 24, 2026 17:1163,98331,292,52823,674,00002,113,536
9Jun 24, 2026 17:1164,09731,756,62423,716,00002,113,536