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 15:50Victor MerckléVictor MerckléScore: 69,486Success
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 15:5169,09434,319,18924,360,0001,205,0002,113,536
2May 11, 2026 15:5169,11334,112,80724,371,0001,201,0002,113,536
3May 11, 2026 15:5169,15934,337,17324,393,0001,196,0002,113,536
4May 11, 2026 15:5169,24536,281,90324,468,0001,153,0002,113,536
5May 11, 2026 15:5169,48636,112,73724,543,0001,167,0002,113,536
6May 11, 2026 15:5169,53534,516,69224,510,0001,218,0002,113,536
7May 11, 2026 15:5171,25449,037,68625,343,0001,021,0002,117,632
8May 11, 2026 15:5175,28147,380,32126,567,0001,287,0002,113,536
9May 11, 2026 15:51192,23282,782,19569,946,0001,180,0002,113,536