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 16:21olliecrowolliecrowScore: 66,868Success
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 16:2163,20551,740,58022,370,0001,016,0002,351,104
2Apr 16, 2026 16:2166,86870,010,85023,711,0001,030,0002,269,184
3Apr 16, 2026 16:2167,20065,688,91023,908,000956,0002,285,568