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 30, 2022 20:40PhibPhibScore: 6,499,591Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 30, 2022 20:405,542,5052,112,532,9972,050,726,93602,301,952
2Sep 30, 2022 20:406,499,5912,465,276,9572,404,848,55102,301,952
3Sep 30, 2022 20:407,392,0452,796,629,2332,735,056,77302,314,240