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:25Huy Duc LeHuy Duc LeScore: 72,676Success
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:2572,20551,173,23025,689,0001,027,0002,281,472
2Feb 22, 2024 03:2572,48652,104,01725,827,000993,0002,494,464
3Feb 22, 2024 03:2572,61454,344,60522,887,0003,980,0002,494,464
4Feb 22, 2024 03:2572,61650,192,91225,873,000995,0002,502,656
5Feb 22, 2024 03:2572,62254,309,89125,837,0001,033,0002,281,472
6Feb 22, 2024 03:2572,63852,325,48925,881,000995,0002,490,368
7Feb 22, 2024 03:2572,67653,539,31522,907,0003,983,0002,494,464
8Feb 22, 2024 03:2572,94151,375,32324,989,0001,999,0002,281,472
9Feb 22, 2024 03:2573,08448,904,54424,037,0003,004,0002,498,560
10Feb 22, 2024 03:2577,16991,593,58628,552,50002,220,032
11Feb 22, 2024 03:2577,230105,985,08428,575,09402,224,128
12Feb 22, 2024 03:2577,342101,785,69628,616,53902,297,856