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 14:38Josu San MartinJosu San MartinScore: 79,022Success
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 14:3878,67854,654,18127,104,0002,007,0002,281,472
2Jan 12, 2026 14:3879,02254,854,48327,222,0002,016,0002,363,392
3Jan 12, 2026 14:3879,18150,526,06827,277,0002,020,0002,281,472