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 10:51IlyaIlyaScore: 60,602Success
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 10:5360,37031,782,68621,236,0001,101,0002,113,536
2Jun 30, 2026 10:5360,42431,808,23321,139,0001,218,0002,113,536
3Jun 30, 2026 10:5360,48631,749,87721,264,0001,116,0002,113,536
4Jun 30, 2026 10:5360,55132,420,31021,197,0001,207,0002,113,536
5Jun 30, 2026 10:5360,60232,324,64621,213,0001,210,0002,113,536
6Jun 30, 2026 10:5360,70231,948,44521,264,0001,196,0002,113,536
7Jun 30, 2026 10:5360,73732,399,87921,268,0001,205,0002,113,536
8Jun 30, 2026 10:5360,81832,514,34021,250,0001,253,0002,113,536
9Jun 30, 2026 10:5360,99732,010,16421,483,0001,086,0002,113,536