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 02:56Kenneth MaplesKenneth MaplesScore: 87,159Success
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 02:5686,56253,660,16930,027,0002,001,0002,273,280
2Dec 24, 2023 02:5686,57653,622,34731,032,0001,001,0002,494,464
3Dec 24, 2023 02:5686,70856,286,99130,077,0002,005,0002,510,848
4Dec 24, 2023 02:5686,81156,039,90231,117,0001,003,0002,281,472
5Dec 24, 2023 02:5686,90554,038,07430,146,0002,009,0002,273,280
6Dec 24, 2023 02:5686,93257,507,31530,155,0002,010,0002,269,184
7Dec 24, 2023 02:5687,15955,645,83431,242,0001,007,0002,273,280
8Dec 24, 2023 02:5687,22260,543,11730,255,0002,017,0002,498,560
9Dec 24, 2023 02:5687,24155,214,83431,271,0001,008,0002,514,944
10Dec 24, 2023 02:5689,66393,302,19333,175,15102,220,032
11Dec 24, 2023 02:5689,90492,199,59733,264,52002,232,320
12Dec 24, 2023 02:5690,26699,195,52233,398,26702,232,320