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 28, 2026 09:47Shikhar SoniShikhar SoniScore: 72,364Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 28, 2026 09:4872,10236,130,11725,637,0001,041,0002,113,536
2Jun 28, 2026 09:4872,13536,169,54025,650,0001,040,0002,113,536
3Jun 28, 2026 09:4872,18136,223,06325,666,0001,041,0002,113,536
4Jun 28, 2026 09:4872,26436,202,81225,696,0001,042,0002,113,536
5Jun 28, 2026 09:4872,36436,765,69125,731,0001,044,0002,113,536
6Jun 28, 2026 09:4872,45936,673,63925,764,0001,046,0002,113,536
7Jun 28, 2026 09:4872,51836,387,93225,787,0001,045,0002,113,536
8Jun 28, 2026 09:4872,68336,623,57525,849,0001,044,0002,113,536
9Jun 28, 2026 09:4872,75636,814,02825,874,0001,046,0002,113,536