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 05:09Josu San MartinJosu San MartinScore: 70,984Success
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 05:0970,77653,232,50124,173,0002,014,0002,355,200
2Jan 12, 2026 05:0970,98447,660,05425,254,0001,010,0002,355,200
3Jan 12, 2026 05:0971,25748,652,83425,351,0001,014,0002,359,296