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:44Yuriy LyfenkoYuriy LyfenkoScore: 114,489Success
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:44114,413106,132,25942,332,70202,203,648
2Jul 8, 2021 19:44114,489107,294,02542,360,76002,203,648
3Jul 8, 2021 19:44115,508108,982,85442,737,89702,199,552