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 17:12Victor MerckléVictor MerckléScore: 66,745Success
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 17:1366,59733,589,20523,534,0001,107,0002,113,536
2May 11, 2026 17:1366,62433,351,76323,553,0001,098,0002,113,536
3May 11, 2026 17:1366,63733,456,34623,546,0001,110,0002,113,536
4May 11, 2026 17:1366,72435,894,16623,604,0001,084,0002,113,536
5May 11, 2026 17:1366,74533,452,07023,612,0001,084,0002,113,536
6May 11, 2026 17:1366,78334,342,02023,601,0001,109,0002,113,536
7May 11, 2026 17:1366,82436,613,13523,710,0001,015,0002,113,536
8May 11, 2026 17:1367,14536,508,79223,759,0001,085,0002,113,536
9May 11, 2026 17:1367,20537,924,84923,754,0001,112,0002,113,536