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 listDec 12, 2024 18:39Yuriy LyfenkoYuriy LyfenkoScore: 60,308Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 12, 2024 18:3959,79743,272,18619,108,0003,017,0002,527,232
2Dec 12, 2024 18:3960,30843,439,76121,300,0001,014,0002,527,232
3Dec 12, 2024 18:3960,45943,875,05221,354,0001,016,0002,527,232