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 listJan 13, 2026 01:31Josu San MartinJosu San MartinScore: 73,135Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 13, 2026 01:3173,05956,448,68725,030,0002,002,0002,367,488
2Jan 13, 2026 01:3173,13555,656,55125,056,0002,004,0002,359,296
3Jan 13, 2026 01:3173,39749,806,54525,146,0002,011,0002,363,392