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 07:38Huy Duc LeHuy Duc LeScore: 67,535Success
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 07:3867,14150,088,45323,849,000993,0002,273,280
2Feb 22, 2024 07:3867,18655,027,37723,865,000994,0002,498,560
3Feb 22, 2024 07:3867,18951,854,42922,872,0001,988,0002,506,752
4Feb 22, 2024 07:3867,24652,418,71421,896,0002,985,0002,273,280
5Feb 22, 2024 07:3867,27354,442,28521,904,0002,987,0002,498,560
6Feb 22, 2024 07:3867,47052,999,36621,969,0002,995,0002,273,280
7Feb 22, 2024 07:3867,53550,305,81022,989,0001,999,0002,277,376
8Feb 22, 2024 07:3867,59256,991,14923,009,0002,000,0002,273,280
9Feb 22, 2024 07:3867,63055,032,72923,022,0002,001,0002,273,280
10Feb 22, 2024 07:3871,93490,559,13326,615,75002,256,896
11Feb 22, 2024 07:3871,957112,241,38526,624,25502,252,800
12Feb 22, 2024 07:3872,61996,799,98326,869,16902,248,704