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 22:28Yuriy LyfenkoYuriy LyfenkoScore: 6,631,999Success
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 22:28207,6711,015,420,99676,838,255060,985,344
2Jul 7, 2021 22:28209,2561,005,828,33177,424,794059,277,312
3Jul 7, 2021 22:28216,2541,070,117,96380,014,098062,799,872
4Jul 7, 2021 22:286,631,9993,008,989,7532,453,839,79302,220,032
5Jul 7, 2021 22:2815,647,0396,344,566,4425,789,404,46602,326,528
6Jul 7, 2021 22:2816,658,7966,770,083,1236,163,754,52202,207,744