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:55Kenneth MaplesKenneth MaplesScore: 87,924Success
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:5587,00551,832,52731,186,0001,006,0002,502,656
2Dec 24, 2023 02:5587,15756,251,86431,241,0001,007,0002,498,560
3Dec 24, 2023 02:5587,38158,233,09930,311,0002,020,0002,334,720
4Dec 24, 2023 02:5587,53255,229,55730,363,0002,024,0002,523,136
5Dec 24, 2023 02:5587,69260,143,63231,433,0001,013,0002,494,464
6Dec 24, 2023 02:5587,74954,017,59431,453,0001,014,0002,314,240
7Dec 24, 2023 02:5587,92454,088,23230,499,0002,033,0002,502,656
8Dec 24, 2023 02:5587,97053,558,73831,532,0001,017,0002,506,752
9Dec 24, 2023 02:5588,01959,133,12931,550,0001,017,0002,502,656
10Dec 24, 2023 02:5590,478104,574,84633,476,76102,232,320
11Dec 24, 2023 02:5590,81594,663,65233,601,60802,224,128
12Dec 24, 2023 02:5590,969106,013,75133,658,41102,224,128