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 21, 2026 23:02A_ShamanA_ShamanScore: 73,954Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 21, 2026 23:0573,46436,423,64326,137,0001,045,0002,113,536
2Jun 21, 2026 23:0573,79137,067,13126,255,0001,048,0002,113,536
3Jun 21, 2026 23:0573,80036,584,16326,260,0001,046,0002,113,536
4Jun 21, 2026 23:0573,88137,019,55926,288,0001,048,0002,113,536
5Jun 21, 2026 23:0573,95436,996,32626,316,0001,047,0002,113,536
6Jun 21, 2026 23:0573,98136,973,38326,324,0001,049,0002,113,536
7Jun 21, 2026 23:0574,46437,231,88426,503,0001,049,0002,113,536
8Jun 21, 2026 23:0574,53237,231,17126,528,0001,049,0002,113,536
9Jun 21, 2026 23:0574,62937,907,33926,565,0001,048,0002,113,536