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 3, 2024 18:00spacecat8086spacecat8086Score: 115,681Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 3, 2024 18:00115,23569,588,09141,622,0001,015,0002,285,568
2Dec 3, 2024 18:00115,68170,015,47840,812,0001,990,0002,285,568
3Dec 3, 2024 18:00116,04968,355,71940,941,0001,997,0002,285,568