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 17, 2026 01:12Josu San MartinJosu San MartinScore: 70,243Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 17, 2026 01:1270,09555,825,99723,940,0001,995,0002,355,200
2Jan 17, 2026 01:1270,24354,423,01724,991,000999,0002,502,656
3Jan 17, 2026 01:1270,50555,844,99425,084,0001,003,0002,359,296