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 13, 2021 17:28Yuriy LyfenkoYuriy LyfenkoScore: 96,324Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 13, 2021 17:2895,42260,932,78233,289,0002,017,0002,334,720
2Jul 13, 2021 17:2895,62761,419,73232,350,0003,032,0002,519,040
3Jul 13, 2021 17:2895,63856,438,06834,375,0001,011,0002,334,720
4Jul 13, 2021 17:2895,67059,897,18133,376,0002,022,0002,527,232
5Jul 13, 2021 17:2895,79264,627,63533,418,0002,025,0002,523,136
6Jul 13, 2021 17:2896,01963,210,12934,512,0001,015,0002,334,720
7Jul 13, 2021 17:2896,32462,927,29533,604,0002,036,0002,523,136
8Jul 13, 2021 17:2896,45161,052,76334,668,0001,019,0002,334,720
9Jul 13, 2021 17:2896,78165,254,60634,815,000994,0002,334,720
10Jul 13, 2021 17:2898,369103,546,41536,396,68802,179,072
11Jul 13, 2021 17:2898,493105,703,10436,442,57002,179,072
12Jul 13, 2021 17:2898,98799,829,67036,625,15402,183,168