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 18:21Yuriy LyfenkoYuriy LyfenkoScore: 64,435Success
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 18:2164,216550,203,82022,770,000990,0002,527,232
2Jul 13, 2021 18:2164,232550,068,79922,776,000990,0002,285,568
3Jul 13, 2021 18:2164,238549,526,11921,788,0001,980,0002,285,568
4Jul 13, 2021 18:2164,303551,072,06622,801,000991,0002,285,568
5Jul 13, 2021 18:2164,368546,435,61021,832,0001,984,0002,527,232
6Jul 13, 2021 18:2164,378546,571,71121,835,0001,985,0002,281,472
7Jul 13, 2021 18:2164,435545,894,83321,855,0001,986,0002,281,472
8Jul 13, 2021 18:2164,514545,353,62321,881,0001,989,0002,281,472
9Jul 13, 2021 18:2164,624545,797,94721,919,0001,992,0002,531,328
10Jul 13, 2021 18:2166,763578,075,71324,702,46202,248,704
11Jul 13, 2021 18:2167,119587,003,31224,833,92602,248,704
12Jul 13, 2021 18:2167,201584,219,30224,864,40702,260,992