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 17, 2024 23:11Joad NacerJoad NacerScore: 21,758,543Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 17, 2024 23:1121,553,4748,053,022,9107,974,785,32602,297,856
2Apr 17, 2024 23:1121,758,5438,104,931,9298,050,661,06002,297,856
3Apr 17, 2024 23:1121,814,2228,133,174,7598,071,262,06802,289,664