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:01Maxim ElchuginMaxim ElchuginScore: 21,365,810Success
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:0121,313,4297,951,953,2447,885,968,73102,297,856
2May 22, 2024 15:0121,365,8107,962,056,2837,905,349,78702,297,856
3May 22, 2024 15:0121,382,7787,979,292,1537,911,627,79502,297,856