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 listApr 11, 2025 20:47Yuriy LyfenkoYuriy LyfenkoScore: 59,519Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 11, 2025 20:4759,414542,574,89419,985,0001,998,0002,527,232
2Apr 11, 2025 20:4759,519546,275,59020,020,0002,002,0002,265,088
3Apr 11, 2025 20:4759,573546,445,80720,039,0002,003,0002,527,232