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:10Maxim ElchuginMaxim ElchuginScore: 22,103,586Success
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:1022,086,5468,233,035,8748,172,022,03402,281,472
2May 22, 2024 15:1022,103,5868,234,659,0398,178,326,77802,285,568
3May 22, 2024 15:1022,153,9018,256,281,6278,196,943,19002,277,376