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:08Franek KortaFranek KortaScore: 83,881Success
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:0883,47359,020,01229,889,000996,0002,281,472
2Aug 6, 2022 20:0883,53256,452,28628,913,0001,994,0002,281,472
3Aug 6, 2022 20:0883,60554,782,91228,939,0001,995,0002,281,472
4Aug 6, 2022 20:0883,61159,821,87328,941,0001,995,0002,281,472
5Aug 6, 2022 20:0883,68953,979,16029,967,000998,0002,281,472
6Aug 6, 2022 20:0883,75154,515,61327,990,0002,998,0002,281,472
7Aug 6, 2022 20:0883,88153,476,38029,034,0002,002,0002,281,472
8Aug 6, 2022 20:0883,94355,588,01329,056,0002,003,0002,281,472
9Aug 6, 2022 20:0884,12598,958,63131,126,41102,260,992
10Aug 6, 2022 20:0884,21954,686,90229,151,0002,010,0002,281,472
11Aug 6, 2022 20:0884,49393,204,80631,262,27902,269,184
12Aug 6, 2022 20:0884,60595,735,88131,303,69102,260,992