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 2, 2022 19:06Yuriy LyfenkoYuriy LyfenkoScore: 61,746Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2022 19:0661,473550,139,30921,757,000988,0002,277,376
2Aug 2, 2022 19:0661,514551,611,96220,781,0001,979,0002,289,664
3Aug 2, 2022 19:0661,527553,913,80221,776,000989,0002,285,568
4Aug 2, 2022 19:0661,527550,752,96820,786,0001,979,0002,281,472
5Aug 2, 2022 19:0661,595550,157,98822,790,00002,289,664
6Aug 2, 2022 19:0661,616546,649,55621,807,000991,0002,285,568
7Aug 2, 2022 19:0661,746545,377,90620,860,0001,986,0002,281,472
8Aug 2, 2022 19:0661,784547,019,28920,873,0001,987,0002,285,568
9Aug 2, 2022 19:0661,824546,140,19420,886,0001,989,0002,265,088
10Aug 2, 2022 19:0664,063580,706,22223,703,36502,265,088
11Aug 2, 2022 19:0664,102595,556,62023,717,56702,252,800
12Aug 2, 2022 19:0664,128592,521,26023,727,34402,248,704