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:25Yuriy LyfenkoYuriy LyfenkoScore: 293,161Success
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:25293,050187,669,444108,428,33702,199,552
2Jul 8, 2021 19:25293,161167,681,079108,469,59102,207,744
3Jul 8, 2021 19:25293,669163,308,865108,657,67602,211,840