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 listMar 30, 2024 10:04woodsy-sounding-wilful-sapwoodwoodsy-sounding-wilful-sapwoodScore: 2,367,218Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 30, 2024 10:042,291,942904,970,865848,018,39402,289,664
2Mar 30, 2024 10:042,367,218936,268,439875,870,69402,293,760
3Mar 30, 2024 10:042,642,6161,034,101,177977,767,79602,297,856