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 21:58Elijah KinElijah KinScore: 68,629Success
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 22:0568,52134,822,68924,131,0001,222,0002,113,536
2Jun 21, 2026 22:0568,53534,588,27024,166,0001,192,0002,113,536
3Jun 21, 2026 22:0568,58935,074,72124,162,0001,216,0002,113,536
4Jun 21, 2026 22:0568,61334,614,61524,130,0001,257,0002,113,536
5Jun 21, 2026 22:0568,62934,554,81424,191,0001,202,0002,113,536
6Jun 21, 2026 22:0568,63734,561,45524,194,0001,202,0002,113,536
7Jun 21, 2026 22:0568,81834,682,59424,252,0001,211,0002,113,536
8Jun 21, 2026 22:0569,02935,133,74224,314,0001,227,0002,113,536
9Jun 21, 2026 22:0569,05635,229,81724,321,0001,230,0002,113,536