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 19, 2023 07:51mmalczakmmalczakScore: 99,141Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 19, 2023 07:5197,62756,468,71734,116,0002,006,0002,273,280
2Sep 19, 2023 07:5197,74155,269,87834,155,0002,009,0002,289,664
3Sep 19, 2023 07:5197,83560,035,02534,188,0002,011,0002,277,376
4Sep 19, 2023 07:5198,51957,498,31836,452,00002,379,776
5Sep 19, 2023 07:5198,60561,012,12536,484,00002,531,328
6Sep 19, 2023 07:5199,08462,944,97235,671,000990,0002,289,664
7Sep 19, 2023 07:5199,14161,659,80035,664,0001,018,0002,273,280
8Sep 19, 2023 07:5199,401106,436,70236,778,20502,260,992
9Sep 19, 2023 07:5199,40862,453,00834,793,0001,988,0002,527,232
10Sep 19, 2023 07:5199,601115,076,92436,852,39602,256,896
11Sep 19, 2023 07:5199,60863,346,44935,859,000996,0002,289,664
12Sep 19, 2023 07:51100,385105,624,61137,142,34702,269,184