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 24, 2024 08:30DanielDanielScore: 117,159Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 24, 2024 08:3098,136112,245,00736,310,39902,199,552
2Jul 24, 2024 08:3098,201102,367,24636,334,28102,256,896
3Jul 24, 2024 08:3099,530107,428,39436,825,94502,199,552
4Jul 24, 2024 08:30116,78968,962,97842,208,0001,004,0002,367,488
5Jul 24, 2024 08:30117,07370,832,54841,303,0002,014,0002,281,472
6Jul 24, 2024 08:30117,09566,393,50741,310,0002,015,0002,367,488
7Jul 24, 2024 08:30117,15969,135,30643,349,00002,281,472
8Jul 24, 2024 08:30117,21969,532,55142,363,0001,008,0002,359,296
9Jul 24, 2024 08:30117,25771,306,43642,377,0001,008,0002,281,472
10Jul 24, 2024 08:30117,31666,292,61942,398,0001,009,0002,457,600
11Jul 24, 2024 08:30117,70073,040,26642,537,0001,012,0002,355,200
12Jul 24, 2024 08:30118,50375,193,98941,853,0001,993,0002,355,200