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 18:13olliecrowolliecrowScore: 102,232Success
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 18:13102,22463,500,97436,828,000995,0002,342,912
2Mar 20, 2026 18:13102,23266,828,27435,836,0001,990,0002,326,528
3Mar 20, 2026 18:13102,29564,372,21936,827,0001,022,0002,445,312