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 listMay 11, 2026 23:44Victor MerckléVictor MerckléScore: 65,443Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 23:4565,11832,788,60323,087,0001,007,0002,113,536
2May 11, 2026 23:4565,34334,479,58223,079,0001,098,0002,113,536
3May 11, 2026 23:4565,36733,008,65823,070,0001,116,0002,113,536
4May 11, 2026 23:4565,43732,929,08723,136,0001,076,0002,113,536
5May 11, 2026 23:4565,44333,227,09523,114,0001,100,0002,113,536
6May 11, 2026 23:4565,45933,832,56923,127,0001,093,0002,113,536
7May 11, 2026 23:4565,60833,914,13223,272,0001,003,0002,113,536
8May 11, 2026 23:4565,75635,134,00623,298,0001,032,0002,113,536
9May 11, 2026 23:4565,94036,093,86123,284,0001,114,0002,113,536