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 17:52Yuriy LyfenkoYuriy LyfenkoScore: 89,847Success
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 17:5289,32486,479,24833,050,02202,281,472
2Jul 13, 2021 17:5289,847101,385,77433,243,25002,293,760
3Jul 13, 2021 17:5289,92895,966,62533,273,27102,285,568