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 listMay 23, 2024 18:15CemaCemaScore: 96,470Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 23, 2024 18:1594,90362,194,37033,108,0002,006,0002,281,472
2May 23, 2024 18:1595,22456,483,57333,220,0002,013,0002,506,752
3May 23, 2024 18:1595,45757,729,45133,301,0002,018,0002,510,848
4May 23, 2024 18:1595,52259,050,20933,324,0002,019,0002,281,472
5May 23, 2024 18:1595,75457,244,60833,405,0002,024,0002,510,848
6May 23, 2024 18:1596,24160,836,53935,609,00002,502,656
7May 23, 2024 18:1596,47062,484,70435,694,00002,289,664
8May 23, 2024 18:1596,82759,515,69434,831,000995,0002,281,472
9May 23, 2024 18:1597,02263,178,85434,901,000997,0002,498,560
10May 23, 2024 18:1599,854116,143,59136,946,01802,240,512
11May 23, 2024 18:15101,110117,295,10037,410,77002,228,224
12May 23, 2024 18:15101,81888,406,42337,672,61402,236,416