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 listApr 27, 2026 09:41Charles CabergsCharles CabergsScore: 70,943Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 27, 2026 09:4270,62441,772,92624,121,0002,010,0002,359,296
2Apr 27, 2026 09:4270,65941,536,93124,133,0002,011,0002,363,392
3Apr 27, 2026 09:4270,77847,840,70324,174,0002,014,0002,355,200
4Apr 27, 2026 09:4270,81045,299,19524,185,0002,015,0002,363,392
5Apr 27, 2026 09:4270,94347,326,74425,240,0001,009,0002,355,200
6Apr 27, 2026 09:4271,01647,828,60225,266,0001,010,0002,359,296
7Apr 27, 2026 09:4271,01844,089,82425,267,0001,010,0002,428,928
8Apr 27, 2026 09:4271,02745,503,85224,259,0002,021,0002,355,200
9Apr 27, 2026 09:4271,08942,152,05025,292,0001,011,0002,355,200