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 listAug 6, 2022 22:00Franek KortaFranek KortaScore: 77,408Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 6, 2022 22:0076,64952,640,90926,335,0002,025,0002,363,392
2Aug 6, 2022 22:0076,94949,767,86126,438,0002,033,0002,322,432
3Aug 6, 2022 22:0077,06850,966,70426,479,0002,036,0002,326,528
4Aug 6, 2022 22:0077,07350,332,18927,499,0001,018,0002,314,240
5Aug 6, 2022 22:0077,10355,587,21925,472,0003,056,0002,347,008
6Aug 6, 2022 22:0077,38957,540,27524,544,0004,090,0002,326,528
7Aug 6, 2022 22:0077,40855,047,51626,596,0002,045,0002,306,048
8Aug 6, 2022 22:0077,75155,088,43125,792,0002,976,0002,301,952
9Aug 6, 2022 22:0078,15957,722,57526,925,0001,994,0002,293,760
10Aug 6, 2022 22:0081,353100,643,59030,100,64502,306,048
11Aug 6, 2022 22:0081,64697,667,25530,209,18602,297,856
12Aug 6, 2022 22:0082,067100,836,82730,364,95602,248,704