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 15, 2023 18:28LiamLiamScore: 109,176Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 15, 2023 18:28108,22763,699,39938,042,0002,002,0002,277,376
2Feb 15, 2023 18:28108,31163,095,76038,072,0002,003,0002,277,376
3Feb 15, 2023 18:28108,50866,114,00338,141,0002,007,0002,289,664
4Feb 15, 2023 18:28108,62770,099,88938,183,0002,009,0002,289,664
5Feb 15, 2023 18:28108,69767,408,66939,213,0001,005,0002,281,472
6Feb 15, 2023 18:28108,75162,785,06938,227,0002,011,0002,289,664
7Feb 15, 2023 18:28109,17663,193,41638,376,0002,019,0002,527,232
8Feb 15, 2023 18:28109,17663,284,06239,386,0001,009,0002,289,664
9Feb 15, 2023 18:28109,34667,507,56839,447,0001,011,0002,273,280
10Feb 15, 2023 18:28111,970120,298,14541,429,08202,265,088
11Feb 15, 2023 18:28112,065106,911,99841,464,15502,269,184
12Feb 15, 2023 18:28112,85598,855,41341,756,23402,265,088