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 listNov 19, 2025 18:03Yuriy LyfenkoYuriy LyfenkoScore: 59,630Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 19, 2025 18:0359,565542,602,03220,036,0002,003,0002,523,136
2Nov 19, 2025 18:0359,630542,660,13920,058,0002,005,0002,527,232
3Nov 19, 2025 18:0359,657546,379,35620,067,0002,006,0002,527,232