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:17Josu San MartinJosu San MartinScore: 77,530Success
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:1777,47653,448,58327,643,0001,023,0002,367,488
2Jan 12, 2026 20:1777,53057,149,84027,662,0001,024,0002,367,488
3Jan 12, 2026 20:1778,41158,967,78127,012,0002,000,0002,281,472