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 listJul 14, 2021 14:03Yuriy LyfenkoYuriy LyfenkoScore: 87,638Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 14, 2021 14:0386,24164,079,42728,918,0002,991,0002,531,328
2Jul 14, 2021 14:0386,76257,027,83129,093,0003,009,0002,420,736
3Jul 14, 2021 14:0386,88464,119,36730,138,0002,009,0002,531,328
4Jul 14, 2021 14:0386,95158,873,95830,162,0002,010,0002,535,424
5Jul 14, 2021 14:0387,26860,377,02830,271,0002,018,0002,334,720
6Jul 14, 2021 14:0387,43057,108,75630,328,0002,021,0002,527,232
7Jul 14, 2021 14:0387,638102,429,30732,426,15802,187,264
8Jul 14, 2021 14:0387,831101,813,55632,497,62602,195,456
9Jul 14, 2021 14:0388,21956,502,80231,621,0001,020,0002,527,232
10Jul 14, 2021 14:0388,32272,956,30231,658,0001,021,0002,531,328
11Jul 14, 2021 14:0388,757100,452,77132,839,91402,187,264
12Jul 14, 2021 14:0388,79763,241,73232,855,00002,519,040