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:24e1011e1011Score: 149,921Success
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:26149,54866,282,64354,144,0001,189,0002,113,536
2Oct 20, 2026 08:26149,71666,257,88454,284,0001,111,0002,113,536
3Oct 20, 2026 08:26149,89766,692,82354,276,0001,186,0002,113,536
4Oct 20, 2026 08:26149,91666,877,11854,279,0001,190,0002,113,536
5Oct 20, 2026 08:26149,92166,379,71654,288,0001,183,0002,113,536
6Oct 20, 2026 08:26149,92766,986,84154,284,0001,189,0002,113,536
7Oct 20, 2026 08:26150,09466,529,00154,333,0001,202,0002,113,536
8Oct 20, 2026 08:26150,10866,724,64254,348,0001,192,0002,113,536
9Oct 20, 2026 08:26150,13766,549,10554,426,0001,125,0002,113,536