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 16, 2023 16:40mmalczakmmalczakScore: 98,827Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 16, 2023 16:4097,52256,503,10035,081,0001,002,0002,277,376
2Sep 16, 2023 16:4098,06558,552,94134,269,0002,015,0002,289,664
3Sep 16, 2023 16:4098,24662,591,34535,342,0001,009,0002,289,664
4Sep 16, 2023 16:4098,34662,921,75635,378,0001,010,0002,289,664
5Sep 16, 2023 16:4098,51162,417,68235,437,0001,012,0002,289,664
6Sep 16, 2023 16:4098,53059,137,44535,444,0001,012,0002,273,280
7Sep 16, 2023 16:4098,82757,054,96435,551,0001,015,0002,392,064
8Sep 16, 2023 16:4099,56863,536,84035,845,000995,0002,289,664
9Sep 16, 2023 16:4099,57365,306,02935,847,000995,0002,273,280
10Sep 16, 2023 16:40100,189102,974,92037,070,09802,277,376
11Sep 16, 2023 16:40100,207105,467,78237,076,41002,265,088
12Sep 16, 2023 16:40100,525103,426,89137,194,33902,265,088