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 21, 2026 19:27izotoffizotoffScore: 78,857Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 21, 2026 19:2776,91653,710,43527,443,0001,016,0002,293,760
2Mar 21, 2026 19:2778,85752,428,55027,165,0002,012,0002,437,120
3Mar 21, 2026 19:2779,58657,286,56527,417,0002,030,0002,351,104