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 20:51Victor MerckléVictor MerckléScore: 72,494Success
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 20:5272,35135,918,09525,503,0001,267,0002,113,536
2Jun 24, 2026 20:5272,39135,894,19025,527,0001,258,0002,113,536
3Jun 24, 2026 20:5272,42435,897,41925,580,0001,217,0002,113,536
4Jun 24, 2026 20:5272,43235,843,30525,531,0001,269,0002,113,536
5Jun 24, 2026 20:5272,49435,928,87825,562,0001,261,0002,113,536
6Jun 24, 2026 20:5272,61335,972,15325,595,0001,272,0002,113,536
7Jun 24, 2026 20:5272,68336,025,64125,610,0001,283,0002,113,536
8Jun 24, 2026 20:5272,74336,033,24425,643,0001,272,0002,113,536
9Jun 24, 2026 20:5272,75436,050,22325,632,0001,287,0002,113,536