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 04:09Huy Duc LeHuy Duc LeScore: 72,822Success
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 04:0972,18952,330,65524,656,0002,054,0002,519,040
2Feb 22, 2024 04:0972,48652,438,10024,834,0001,986,0002,273,280
3Feb 22, 2024 04:0972,48655,092,69722,847,0003,973,0002,510,848
4Feb 22, 2024 04:0972,54653,516,59224,854,0001,988,0002,269,184
5Feb 22, 2024 04:0972,62456,583,30026,871,00002,273,280
6Feb 22, 2024 04:0972,76260,711,23823,931,0002,991,0002,277,376
7Feb 22, 2024 04:0972,82252,104,09724,949,0001,995,0002,351,104
8Feb 22, 2024 04:0972,83056,123,69523,953,0002,994,0002,523,136
9Feb 22, 2024 04:0972,91657,496,62224,981,0001,998,0002,519,040
10Feb 22, 2024 04:0976,97893,708,17428,481,86102,248,704
11Feb 22, 2024 04:0977,00994,270,06828,493,22402,297,856
12Feb 22, 2024 04:0977,58391,762,21828,705,87102,248,704