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 listFeb 22, 2024 03:15Huy Duc LeHuy Duc LeScore: 84,305Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 22, 2024 03:1583,03258,317,77929,698,0001,024,0002,281,472
2Feb 22, 2024 03:1583,33258,272,12629,839,000994,0002,494,464
3Feb 22, 2024 03:1583,41660,158,49127,878,0002,986,0002,498,560
4Feb 22, 2024 03:1584,02752,438,58028,082,0003,008,0002,498,560
5Feb 22, 2024 03:1584,18953,385,79829,141,0002,009,0002,494,464
6Feb 22, 2024 03:1584,22253,923,96529,152,0002,010,0002,281,472
7Feb 22, 2024 03:1584,30555,102,32131,193,00002,494,464
8Feb 22, 2024 03:1584,38653,640,94829,209,0002,014,0002,281,472
9Feb 22, 2024 03:1584,72454,301,29929,326,0002,022,0002,498,560
10Feb 22, 2024 03:1587,546100,375,30532,391,84502,269,184
11Feb 22, 2024 03:1587,96898,357,11132,548,06902,228,224
12Feb 22, 2024 03:1588,64094,972,30632,796,76402,232,320