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 23, 2024 16:53StanStanScore: 426,478Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 23, 2024 16:53426,057217,824,424157,640,93802,256,896
2May 23, 2024 16:53426,478214,488,579157,796,71102,248,704
3May 23, 2024 16:53427,329220,853,899158,111,63002,256,896