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 30, 2026 21:12IlyaIlyaScore: 59,056Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 30, 2026 21:1358,92431,265,26820,696,0001,106,0002,113,536
2Jun 30, 2026 21:1358,95431,701,01820,685,0001,128,0002,113,536
3Jun 30, 2026 21:1358,96231,252,35820,681,0001,135,0002,113,536
4Jun 30, 2026 21:1359,01831,397,44920,624,0001,213,0002,113,536
5Jun 30, 2026 21:1359,05631,825,34320,670,0001,181,0002,113,536
6Jun 30, 2026 21:1359,09731,838,05320,674,0001,192,0002,113,536
7Jun 30, 2026 21:1359,13231,354,74120,692,0001,187,0002,113,536
8Jun 30, 2026 21:1359,39731,902,60920,774,0001,203,0002,113,536
9Jun 30, 2026 21:1359,53732,015,23420,825,0001,204,0002,113,536