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 13:51Victor MerckléVictor MerckléScore: 62,794Success
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 13:5262,48630,500,07823,120,00002,113,536
2Jun 10, 2026 13:5262,58130,497,18123,155,00002,113,536
3Jun 10, 2026 13:5262,65430,573,83323,182,00002,113,536
4Jun 10, 2026 13:5262,75430,609,64622,175,0001,044,0002,113,536
5Jun 10, 2026 13:5262,79430,753,96023,234,00002,113,536
6Jun 10, 2026 13:5262,90030,666,52323,273,00002,113,536
7Jun 10, 2026 13:5263,02730,904,13923,320,00002,113,536
8Jun 10, 2026 13:5263,51632,073,30423,501,00002,113,536
9Jun 10, 2026 13:52618,827236,370,709228,966,00002,113,536