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 listApr 9, 2023 16:11Franek KortaFranek KortaScore: 81,346Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 9, 2023 16:1177,14648,450,04127,525,0001,019,0002,437,120
2Apr 9, 2023 16:1177,45454,010,71227,635,0001,023,0002,531,328
3Apr 9, 2023 16:1177,91455,918,71128,828,00002,531,328
4Apr 9, 2023 16:1178,91450,819,96326,178,0003,020,0002,441,216
5Apr 9, 2023 16:1179,73051,837,88628,483,0001,017,0002,269,184
6Apr 9, 2023 16:1180,65754,836,93228,849,000994,0002,449,408
7Apr 9, 2023 16:1181,34654,369,01629,095,0001,003,0002,441,216
8Apr 9, 2023 16:1181,50856,028,36229,153,0001,005,0002,445,312
9Apr 9, 2023 16:1182,64956,806,32830,580,00002,437,120
10Apr 9, 2023 16:1185,59180,841,19631,668,65702,174,976
11Apr 9, 2023 16:1187,45097,177,62532,356,48302,297,856
12Apr 9, 2023 16:1187,88194,807,25032,516,04502,289,664