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 listJul 14, 2021 12:38gchebanovgchebanovScore: 83,312Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 14, 2021 12:3883,25396,817,69030,803,53802,248,704
2Jul 14, 2021 12:3883,312100,819,01130,825,49402,248,704
3Jul 14, 2021 12:3883,88795,175,28631,038,12902,236,416