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 7, 2021 21:46Mikhail DektyarevMikhail DektyarevScore: 5,430,245Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2021 21:465,421,6402,465,253,8912,006,006,921062,713,856
2Jul 7, 2021 21:465,430,2452,476,555,0492,009,190,508062,971,904
3Jul 7, 2021 21:465,520,1702,562,363,5152,042,463,062062,574,592