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 6, 2026 10:59Victor MerckléVictor MerckléScore: 64,194Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 6, 2026 11:0064,00832,731,72222,618,0001,065,0002,113,536
2Jun 6, 2026 11:0064,12732,823,40422,663,0001,064,0002,113,536
3Jun 6, 2026 11:0064,15132,803,69522,663,0001,073,0002,113,536
4Jun 6, 2026 11:0064,15932,850,27222,604,0001,135,0002,113,536
5Jun 6, 2026 11:0064,19432,852,57022,603,0001,149,0002,113,536
6Jun 6, 2026 11:0064,30232,902,58022,657,0001,135,0002,113,536
7Jun 6, 2026 11:0064,71833,050,14922,808,0001,138,0002,113,536
8Jun 6, 2026 11:0064,72133,105,21122,799,0001,148,0002,113,536
9Jun 6, 2026 11:0064,72733,058,73522,806,0001,143,0002,113,536