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 13, 2021 14:42Yuriy LyfenkoYuriy LyfenkoScore: 241,552Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 13, 2021 14:42240,181168,548,26488,866,86702,183,168
2Jul 13, 2021 14:42241,552169,191,11689,374,05502,187,264
3Jul 13, 2021 14:42241,628144,146,38689,402,26302,183,168