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 16:33Yuriy LyfenkoYuriy LyfenkoScore: 107,043Success
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 16:33106,40560,521,22036,342,0003,028,0002,523,136
2Jul 13, 2021 16:33106,63261,529,84938,443,0001,011,0002,334,720
3Jul 13, 2021 16:33106,65963,763,39138,453,0001,011,0002,519,040
4Jul 13, 2021 16:33106,71460,271,78738,472,0001,012,0002,334,720
5Jul 13, 2021 16:33106,71468,179,99238,472,0001,012,0002,334,720
6Jul 13, 2021 16:33106,88965,808,93837,521,0002,028,0002,519,040
7Jul 13, 2021 16:33107,04364,300,48738,591,0001,015,0002,334,720
8Jul 13, 2021 16:33107,11167,519,09837,599,0002,032,0002,326,528
9Jul 13, 2021 16:33107,17363,398,49537,621,0002,033,0002,334,720
10Jul 13, 2021 16:33109,466105,633,01240,502,36902,183,168
11Jul 13, 2021 16:33109,52997,174,71540,525,82202,187,264
12Jul 13, 2021 16:33109,533105,661,38440,527,07602,174,976