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 22, 2024 16:31Maxim ElchuginMaxim ElchuginScore: 438,813Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 22, 2024 16:31437,044235,623,322161,706,29002,273,280
2May 22, 2024 16:31438,813227,397,588162,360,94202,256,896
3May 22, 2024 16:31440,073221,299,732162,827,08602,269,184