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 listJun 24, 2026 18:07Victor MerckléVictor MerckléScore: 72,421Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 24, 2026 18:0872,20835,831,25225,633,0001,084,0002,113,536
2Jun 24, 2026 18:0872,23535,943,00925,635,0001,092,0002,113,536
3Jun 24, 2026 18:0872,27535,809,81825,639,0001,103,0002,113,536
4Jun 24, 2026 18:0872,35635,872,93425,683,0001,089,0002,113,536
5Jun 24, 2026 18:0872,42135,942,10025,687,0001,109,0002,113,536
6Jun 24, 2026 18:0872,50835,979,05925,803,0001,025,0002,113,536
7Jun 24, 2026 18:0872,74335,979,25225,817,0001,098,0002,113,536
8Jun 24, 2026 18:0872,88936,335,00625,864,0001,105,0002,113,536
9Jun 24, 2026 18:0873,06736,185,76026,010,0001,025,0002,113,536