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:07A_ShamanA_ShamanScore: 73,064Success
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:0872,79436,508,72325,892,0001,042,0002,113,536
2Jul 2, 2026 23:0872,86436,952,52025,916,0001,044,0002,113,536
3Jul 2, 2026 23:0872,91336,604,17725,933,0001,045,0002,113,536
4Jul 2, 2026 23:0872,93536,958,46425,942,0001,044,0002,113,536
5Jul 2, 2026 23:0873,06436,547,24925,992,0001,042,0002,113,536
6Jul 2, 2026 23:0873,07237,021,99625,991,0001,046,0002,113,536
7Jul 2, 2026 23:0873,11836,976,68026,008,0001,046,0002,113,536
8Jul 2, 2026 23:0873,20537,057,07626,042,0001,044,0002,113,536
9Jul 2, 2026 23:0873,25937,060,27626,062,0001,044,0002,113,536