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:23Josu San MartinJosu San MartinScore: 72,630Success
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:2371,92755,122,15826,613,00002,289,664
2Jan 12, 2026 20:2372,63057,675,41324,883,0001,990,0002,289,664
3Jan 12, 2026 20:2372,74159,870,18925,918,000996,0002,359,296