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 15:07Maxim ElchuginMaxim ElchuginScore: 22,402,435Success
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 15:0722,359,7608,339,201,2078,273,111,05902,277,376
2May 22, 2024 15:0722,402,4358,350,822,0408,288,900,83702,269,184
3May 22, 2024 15:0722,403,0568,353,619,7808,289,130,67002,281,472