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 listJul 3, 2026 18:00Joshua MontrossJoshua MontrossScore: 22,396,213Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 3, 2026 18:0122,292,8438,258,500,8518,093,411,000154,941,0002,113,536
2Jul 3, 2026 18:0122,396,2138,296,321,8048,127,197,000159,402,0002,113,536
3Jul 3, 2026 18:0122,438,8458,312,099,2668,147,759,000154,614,0002,113,536