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 listMar 20, 2026 17:24olliecrowolliecrowScore: 101,416Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 20, 2026 17:24101,31159,867,80936,472,0001,013,0002,441,216
2Mar 20, 2026 17:24101,41659,609,14736,510,0001,014,0002,445,312
3Mar 20, 2026 17:24103,34660,717,49035,220,0003,018,0002,437,120