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 19:00Yuriy LyfenkoYuriy LyfenkoScore: 62,176Success
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 19:0061,832547,479,61021,884,000994,0002,281,472
2Jul 13, 2021 19:0061,841547,771,16020,892,0001,989,0002,527,232
3Jul 13, 2021 19:0061,954546,359,32121,927,000996,0002,281,472
4Jul 13, 2021 19:0061,962551,635,42520,933,0001,993,0002,281,472
5Jul 13, 2021 19:0062,014548,674,25920,950,0001,995,0002,281,472
6Jul 13, 2021 19:0062,019551,024,21520,952,0001,995,0002,285,568
7Jul 13, 2021 19:0062,176551,268,36321,005,0002,000,0002,269,184
8Jul 13, 2021 19:0062,235546,352,52521,025,0002,002,0002,285,568
9Jul 13, 2021 19:0062,416551,978,03923,094,00002,285,568
10Jul 13, 2021 19:0064,310580,518,32323,794,67202,248,704
11Jul 13, 2021 19:0064,644583,585,31423,918,17702,240,512
12Jul 13, 2021 19:0064,707595,084,56723,941,47802,244,608