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 listApr 16, 2026 20:59olliecrowolliecrowScore: 132,438Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 16, 2026 20:59129,93572,005,11946,073,0002,003,0002,514,944
2Apr 16, 2026 20:59132,43874,622,10947,002,0002,000,0002,527,232
3Apr 16, 2026 20:59136,54977,436,36949,513,0001,010,0002,514,944