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 26, 2026 21:09Charles CabergsCharles CabergsScore: 70,978Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 26, 2026 21:1070,70547,876,10224,149,0002,012,0002,310,144
2Apr 26, 2026 21:1070,82140,291,34324,189,0002,015,0002,355,200
3Apr 26, 2026 21:1070,83543,022,38624,193,0002,016,0002,351,104
4Apr 26, 2026 21:1070,88947,453,00824,212,0002,017,0002,347,008
5Apr 26, 2026 21:1070,97843,414,07524,242,0002,020,0002,359,296
6Apr 26, 2026 21:1070,99444,165,55824,248,0002,020,0002,363,392
7Apr 26, 2026 21:1071,02145,170,28424,257,0002,021,0002,310,144
8Apr 26, 2026 21:1071,05441,767,75424,268,0002,022,0002,351,104
9Apr 26, 2026 21:1071,15948,282,32424,304,0002,025,0002,359,296