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 22, 2023 21:37mmalczakmmalczakScore: 73,927Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 22, 2023 21:3773,45954,264,13826,174,0001,006,0002,289,664
2Sep 22, 2023 21:3773,64648,491,92126,240,0001,009,0002,392,064
3Sep 22, 2023 21:3773,64952,121,65725,232,0002,018,0002,277,376
4Sep 22, 2023 21:3773,72448,285,74525,258,0002,020,0002,289,664
5Sep 22, 2023 21:3773,75948,422,40225,270,0002,021,0002,289,664
6Sep 22, 2023 21:3773,90850,926,30426,334,0001,012,0002,531,328
7Sep 22, 2023 21:3773,92749,843,14425,327,0002,026,0002,289,664
8Sep 22, 2023 21:3774,34951,173,32126,491,0001,018,0002,277,376
9Sep 22, 2023 21:3774,62261,454,77026,588,0001,022,0002,281,472
10Sep 22, 2023 21:3776,440103,724,44528,282,65302,277,376
11Sep 22, 2023 21:3776,48497,679,31928,298,94502,256,896
12Sep 22, 2023 21:3776,62586,875,66028,351,34802,269,184