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 17:59Andrey TsvetkovAndrey TsvetkovScore: 323,735Success
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:04322,246186,116,263119,231,16802,199,552
2Jul 12, 2021 18:04323,079180,310,512119,539,21602,199,552
3Jul 12, 2021 17:59323,710185,152,252119,772,65902,199,552
4Jul 12, 2021 17:59323,735188,565,967119,781,82602,211,840
5Jul 12, 2021 18:04324,323182,008,910119,999,48502,199,552
6Jul 12, 2021 17:59324,372175,080,446120,017,68602,199,552