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:53Yuriy LyfenkoYuriy LyfenkoScore: 4,543,147Success
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:53217,983562,572,23780,653,635063,741,952
2Jul 7, 2021 21:53219,400535,585,24781,177,827059,273,216
3Jul 7, 2021 21:53226,088585,802,42383,652,722063,086,592
4Jul 7, 2021 21:534,543,1471,743,678,9051,680,964,35402,314,240
5Jul 7, 2021 21:539,468,9633,565,851,3163,503,516,38802,211,840
6Jul 7, 2021 21:5314,914,7135,577,716,4065,518,443,71002,265,088