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 listMay 26, 2025 06:14E SequeiraE SequeiraScore: 235,754Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 26, 2025 06:14235,654111,870,12486,190,0001,002,0002,285,568
2May 26, 2025 06:14235,754109,526,07585,224,0002,005,0002,285,568
3May 26, 2025 06:14236,016110,010,35986,323,0001,003,0002,519,040