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 listAug 29, 2023 20:23Franek KortaFranek KortaScore: 72,630Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 29, 2023 20:2372,04151,223,17425,630,0001,025,0002,531,328
2Aug 29, 2023 20:2372,12757,862,33225,661,0001,026,0002,531,328
3Aug 29, 2023 20:2372,41651,358,78623,703,0003,091,0002,531,328
4Aug 29, 2023 20:2372,54950,871,41626,843,00002,433,024
5Aug 29, 2023 20:2372,58457,213,68725,862,000994,0002,265,088
6Aug 29, 2023 20:2372,58654,003,34824,868,0001,989,0002,265,088
7Aug 29, 2023 20:2372,63049,121,02425,878,000995,0002,441,216
8Aug 29, 2023 20:2372,90347,650,41125,975,000999,0002,531,328
9Aug 29, 2023 20:2372,94948,235,90525,992,000999,0002,269,184
10Aug 29, 2023 20:2377,35890,559,99728,622,40602,285,568
11Aug 29, 2023 20:2377,87494,786,36728,813,32902,297,856
12Aug 29, 2023 20:2378,20491,712,72628,935,35502,297,856