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 listNov 10, 2025 18:48izotoffizotoffScore: 128,641Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 10, 2025 18:48127,96867,309,22843,319,0004,029,0002,297,856
2Nov 10, 2025 18:48128,64173,027,96046,585,0001,012,0002,297,856
3Nov 10, 2025 18:48129,25773,708,75843,840,0003,985,0002,297,856