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 23, 2026 14:42Dominique GarmierDominique GarmierScore: 225,611Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 23, 2026 14:42225,243108,348,88080,328,0003,012,0002,519,040
2Mar 23, 2026 14:42225,611103,176,04381,465,0002,011,0002,351,104
3Mar 23, 2026 14:42228,211108,541,12382,428,0002,010,0002,367,488