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 8, 2021 19:40Yuriy LyfenkoYuriy LyfenkoScore: 138,930Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 8, 2021 19:40138,151110,206,39151,115,68602,199,552
2Jul 8, 2021 19:40138,930108,333,81851,404,26402,199,552
3Jul 8, 2021 19:40139,211107,138,40251,507,96302,191,360