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 21, 2021 18:13Yuriy LyfenkoYuriy LyfenkoScore: 61,746Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 21, 2021 18:1361,554553,851,05520,795,0001,980,0002,273,280
2Aug 21, 2021 18:1361,586553,744,78720,806,0001,981,0002,281,472
3Aug 21, 2021 18:1361,603544,466,70320,811,0001,982,0002,281,472
4Aug 21, 2021 18:1361,638554,942,67221,770,0001,036,0002,281,472
5Aug 21, 2021 18:1361,654545,761,81721,821,000991,0002,281,472
6Aug 21, 2021 18:1361,705546,220,57021,839,000992,0002,281,472
7Aug 21, 2021 18:1361,746546,605,74920,860,0001,986,0002,281,472
8Aug 21, 2021 18:1361,819550,563,08920,884,0001,989,0002,285,568
9Aug 21, 2021 18:1361,870552,286,14920,902,0001,990,0002,269,184
10Aug 21, 2021 18:1364,337583,856,39523,804,67602,252,800
11Aug 21, 2021 18:1364,616596,845,81323,907,95602,248,704
12Aug 21, 2021 18:1364,680591,491,86923,931,55802,252,800