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 12, 2026 20:11Josu San MartinJosu San MartinScore: 72,538Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 12, 2026 20:1172,50052,484,11426,825,00002,355,200
2Jan 12, 2026 20:1172,53856,999,08325,845,000994,0002,359,296
3Jan 12, 2026 20:1172,64358,102,57825,883,000995,0002,367,488