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 listSep 15, 2021 20:14piculpiculScore: 72,800Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 15, 2021 20:1472,26551,319,35425,710,0001,028,0002,527,232
2Sep 15, 2021 20:1472,44356,828,12625,812,000992,0002,289,664
3Sep 15, 2021 20:1472,50353,175,48324,839,0001,987,0002,289,664
4Sep 15, 2021 20:1472,53552,072,99125,844,000994,0002,269,184
5Sep 15, 2021 20:1472,53550,393,82525,844,000994,0002,289,664
6Sep 15, 2021 20:1472,57359,015,39724,863,0001,989,0002,289,664
7Sep 15, 2021 20:1472,80056,357,08524,941,0001,995,0002,523,136
8Sep 15, 2021 20:1472,98948,928,98326,006,0001,000,0002,363,392
9Sep 15, 2021 20:1473,07349,707,72325,035,0002,002,0002,289,664
10Sep 15, 2021 20:1475,36897,888,35327,886,30202,265,088
11Sep 15, 2021 20:1475,482108,092,12827,928,20902,277,376
12Sep 15, 2021 20:1475,765105,707,27328,032,92702,269,184