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 21, 2026 08:04Charles CabergsCharles CabergsScore: 70,972Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 21, 2026 08:0570,66752,238,65724,136,0002,011,0002,355,200
2Apr 21, 2026 08:0570,70552,871,79124,149,0002,012,0002,355,200
3Apr 21, 2026 08:0570,77055,476,46824,171,0002,014,0002,355,200
4Apr 21, 2026 08:0570,94354,807,60224,230,0002,019,0002,355,200
5Apr 21, 2026 08:0570,97258,706,32724,240,0002,020,0002,256,896
6Apr 21, 2026 08:0570,99453,582,22924,248,0002,020,0002,514,944
7Apr 21, 2026 08:0571,05653,265,74224,269,0002,022,0002,375,680
8Apr 21, 2026 08:0571,12755,657,09824,293,0002,024,0002,342,912
9Apr 21, 2026 08:0571,24855,652,58325,349,0001,013,0002,351,104