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 listJul 16, 2026 06:43Fernando AntunezFernando AntunezScore: 104,540Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 16, 2026 06:44104,47848,234,87937,641,0001,016,0002,113,536
2Jul 16, 2026 06:44104,54048,295,62537,439,0001,241,0002,113,536
3Jul 16, 2026 06:44104,81648,335,61137,557,0001,225,0002,113,536