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 6, 2022 20:30Franek KortaFranek KortaScore: 74,662Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 6, 2022 20:3074,16549,825,67625,409,0002,032,0002,285,568
2Aug 6, 2022 20:3074,30349,469,48125,456,0002,036,0002,269,184
3Aug 6, 2022 20:3074,36553,966,77523,439,0004,076,0002,281,472
4Aug 6, 2022 20:3074,44153,654,62827,543,00002,281,472
5Aug 6, 2022 20:3074,51149,982,63626,548,0001,021,0002,523,136
6Aug 6, 2022 20:3074,61952,644,37226,587,0001,022,0002,269,184
7Aug 6, 2022 20:3074,66252,776,90125,579,0002,046,0002,281,472
8Aug 6, 2022 20:3074,75458,404,40026,635,0001,024,0002,281,472
9Aug 6, 2022 20:3075,41955,777,17423,919,0003,986,0002,281,472
10Aug 6, 2022 20:3078,57098,899,19129,070,92602,252,800
11Aug 6, 2022 20:3078,62386,437,88929,090,50102,265,088
12Aug 6, 2022 20:3078,80191,853,79129,156,22002,256,896