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 listMar 20, 2026 17:58olliecrowolliecrowScore: 101,486Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 20, 2026 17:58101,23859,318,47736,446,0001,012,0002,342,912
2Mar 20, 2026 17:58101,48659,782,18136,536,0001,014,0002,342,912
3Mar 20, 2026 17:58103,38962,191,72837,248,0001,006,0002,560,000