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 listAug 29, 2023 11:45mmalczakmmalczakScore: 666,931Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 29, 2023 11:45666,640326,714,040246,656,64602,297,856
2Aug 29, 2023 11:45666,931318,208,246246,764,28802,174,976
3Aug 29, 2023 11:45668,393314,810,673247,305,22502,301,952