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 listAug 2, 2026 06:38Victor MerckléVictor MerckléScore: 68,181Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2026 06:4067,97033,568,55225,149,00002,113,536
2Aug 2, 2026 06:4068,07534,240,62124,161,0001,027,0002,113,536
3Aug 2, 2026 06:4068,09733,307,99224,168,0001,028,0002,113,536
4Aug 2, 2026 06:4068,18133,460,95625,227,00002,113,536
5Aug 2, 2026 06:4068,18133,589,37724,222,0001,005,0002,113,536
6Aug 2, 2026 06:4068,20534,280,93324,201,0001,035,0002,113,536
7Aug 2, 2026 06:4068,27033,595,26624,206,0001,054,0002,113,536
8Aug 2, 2026 06:4068,37233,674,02024,271,0001,027,0002,113,536
9Aug 2, 2026 06:4068,39433,470,02424,304,0001,002,0002,113,536