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 13:30Yuriy LyfenkoYuriy LyfenkoScore: 67,139Success
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 13:3067,073586,043,86524,817,05902,248,704
2Jul 8, 2021 13:3067,139593,555,28724,841,48702,248,704
3Jul 8, 2021 13:3067,275583,299,86024,891,85202,248,704