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 19:43Victor MerckléVictor MerckléScore: 70,743Success
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 19:4470,48335,147,62924,801,0001,278,0002,113,536
2Jun 24, 2026 19:4470,53535,252,35424,809,0001,289,0002,113,536
3Jun 24, 2026 19:4470,57835,271,94725,094,0001,020,0002,113,536
4Jun 24, 2026 19:4470,65635,253,00224,877,0001,266,0002,113,536
5Jun 24, 2026 19:4470,74335,335,43225,155,0001,020,0002,113,536
6Jun 24, 2026 19:4470,84335,468,27024,952,0001,260,0002,113,536
7Jun 24, 2026 19:4470,86735,334,96424,935,0001,286,0002,113,536
8Jun 24, 2026 19:4470,90235,270,44424,946,0001,288,0002,113,536
9Jun 24, 2026 19:4471,60035,643,15925,470,0001,022,0002,113,536