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 21:13Victor MerckléVictor MerckléScore: 70,262Success
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 21:1470,12736,551,61424,669,0001,278,0002,113,536
2Jun 24, 2026 21:1470,14035,023,25424,688,0001,264,0002,113,536
3Jun 24, 2026 21:1470,24535,049,76724,972,0001,019,0002,113,536
4Jun 24, 2026 21:1470,25935,114,21624,742,0001,254,0002,113,536
5Jun 24, 2026 21:1470,26235,056,21224,730,0001,267,0002,113,536
6Jun 24, 2026 21:1470,33535,122,83024,755,0001,269,0002,113,536
7Jun 24, 2026 21:1470,57235,185,14124,841,0001,271,0002,113,536
8Jun 24, 2026 21:1470,57535,216,65924,824,0001,289,0002,113,536
9Jun 24, 2026 21:1470,60235,221,47125,102,0001,021,0002,113,536