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:16Maxim ElchuginMaxim ElchuginScore: 1,761,351Success
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:16880,511399,356,709325,789,04502,248,704
2May 22, 2024 15:161,761,351720,218,096651,699,88902,265,088
3May 22, 2024 15:162,012,874809,166,240744,763,24902,265,088