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 15, 2021 11:06Andrey TsvetkovAndrey TsvetkovError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 15, 2021 11:0600000Error: expected "429496458220 ", got "399431723776 "
2Jul 15, 2021 11:0688,620117,227,62632,789,31702,179,072
3Jul 15, 2021 11:0689,25887,396,97533,025,56702,183,168
4Jul 15, 2021 11:0689,30094,792,68733,041,10302,191,360