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 24, 2026 20:42Victor MerckléVictor MerckléScore: 70,324Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 24, 2026 20:4370,18935,046,60024,952,0001,018,0002,113,536
2Jun 24, 2026 20:4370,22735,030,26124,715,0001,269,0002,113,536
3Jun 24, 2026 20:4370,26435,132,22824,717,0001,281,0002,113,536
4Jun 24, 2026 20:4370,27536,298,95924,731,0001,271,0002,113,536
5Jun 24, 2026 20:4370,32435,147,54324,739,0001,281,0002,113,536
6Jun 24, 2026 20:4370,32435,044,69924,757,0001,263,0002,113,536
7Jun 24, 2026 20:4370,57035,228,05524,841,0001,270,0002,113,536
8Jun 24, 2026 20:4370,57235,229,42924,836,0001,276,0002,113,536
9Jun 24, 2026 20:4370,60035,240,62025,101,0001,021,0002,113,536