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 12, 2021 18:09Andrey TsvetkovAndrey TsvetkovScore: 251,094Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 12, 2021 18:09250,784150,622,31092,790,00002,215,936
2Jul 12, 2021 18:09251,094158,859,19492,904,73302,207,744
3Jul 12, 2021 18:09251,213146,754,22292,948,82802,207,744