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 13, 2026 00:08Josu San MartinJosu San MartinScore: 72,011Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 13, 2026 00:0871,88455,664,23826,597,00002,359,296
2Jan 13, 2026 00:0872,01156,343,09126,644,00002,371,584
3Jan 13, 2026 00:0872,55952,036,14125,853,000994,0002,289,664