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 20:15Victor MerckléVictor MerckléScore: 64,797Success
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 20:1664,43734,696,32322,831,0001,011,0002,113,536
2May 11, 2026 20:1664,45432,724,56022,832,0001,016,0002,113,536
3May 11, 2026 20:1664,52732,447,95322,831,0001,044,0002,113,536
4May 11, 2026 20:1664,75435,422,27522,861,0001,098,0002,113,536
5May 11, 2026 20:1664,79733,717,06822,886,0001,089,0002,113,536
6May 11, 2026 20:1664,92733,579,38822,974,0001,049,0002,113,536
7May 11, 2026 20:1664,97033,376,61223,026,0001,013,0002,113,536
8May 11, 2026 20:1665,08933,598,84722,935,0001,148,0002,113,536
9May 11, 2026 20:1665,27535,730,13823,045,0001,107,0002,113,536