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 listJul 2, 2026 23:25A_ShamanA_ShamanScore: 70,278Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 2, 2026 23:2669,91035,433,58424,778,0001,089,0002,113,536
2Jul 2, 2026 23:2670,07035,474,27724,836,0001,090,0002,113,536
3Jul 2, 2026 23:2670,18635,991,57824,802,0001,167,0002,113,536
4Jul 2, 2026 23:2670,18935,998,12024,782,0001,188,0002,113,536
5Jul 2, 2026 23:2670,27836,039,31324,805,0001,198,0002,113,536
6Jul 2, 2026 23:2670,31836,006,98524,832,0001,186,0002,113,536
7Jul 2, 2026 23:2670,38336,105,52024,833,0001,209,0002,113,536
8Jul 2, 2026 23:2670,38335,894,46524,854,0001,188,0002,113,536
9Jul 2, 2026 23:2670,84835,925,99825,135,0001,079,0002,113,536