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 listOct 20, 2026 08:50e1011e1011Score: 137,045Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 20, 2026 08:54136,46261,499,52949,293,0001,198,0002,113,536
2Oct 20, 2026 08:54136,73561,531,72149,390,0001,202,0002,113,536
3Oct 20, 2026 08:54136,94062,307,05249,398,0001,270,0002,113,536
4Oct 20, 2026 08:54136,99162,102,21449,669,0001,018,0002,113,536
5Oct 20, 2026 08:54137,04561,640,12349,696,0001,011,0002,113,536
6Oct 20, 2026 08:54137,19462,206,72949,749,0001,013,0002,113,536
7Oct 20, 2026 08:54137,21062,180,89649,758,0001,010,0002,113,536
8Oct 20, 2026 08:54137,29161,962,56149,528,0001,270,0002,113,536
9Oct 20, 2026 08:54149,26466,163,33254,205,0001,023,0002,113,536