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 listDec 24, 2023 03:07Kenneth MaplesKenneth MaplesScore: 74,708Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 24, 2023 03:0774,21449,394,50327,459,00002,510,848
2Dec 24, 2023 03:0774,35754,164,11927,512,00002,506,752
3Dec 24, 2023 03:0774,45949,872,63526,530,0001,020,0002,506,752
4Dec 24, 2023 03:0774,47854,708,04726,537,0001,020,0002,277,376
5Dec 24, 2023 03:0774,51451,209,71426,549,0001,021,0002,363,392
6Dec 24, 2023 03:0774,56253,831,82826,567,0001,021,0002,281,472
7Dec 24, 2023 03:0774,70858,349,75827,642,00002,510,848
8Dec 24, 2023 03:0774,78457,530,18926,646,0001,024,0002,498,560
9Dec 24, 2023 03:0775,27852,743,98625,864,0001,989,0002,498,560
10Dec 24, 2023 03:0777,46995,664,11328,663,35102,232,320
11Dec 24, 2023 03:0777,882113,826,05828,816,27702,232,320
12Dec 24, 2023 03:0778,34188,721,23028,986,04202,224,128