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 listSep 21, 2023 19:06mmalczakmmalczakScore: 689,203Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 21, 2023 19:04627,050298,729,554232,008,61302,269,184
2Sep 21, 2023 19:06664,952301,721,715246,032,06802,281,472
3Sep 21, 2023 19:04671,797304,242,763248,564,82702,256,896
4Sep 21, 2023 19:06689,203331,815,390255,005,11202,269,184
5Sep 21, 2023 19:04708,824316,190,478262,264,77702,265,088
6Sep 21, 2023 19:06717,800334,977,299265,585,95202,269,184