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 2, 2022 12:35Yuriy LyfenkoYuriy LyfenkoScore: 61,527Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2022 12:3560,935554,887,77621,522,0001,024,0002,273,280
2Aug 2, 2022 12:3560,941546,993,15622,548,00002,289,664
3Aug 2, 2022 12:3561,254554,130,73222,664,00002,289,664
4Aug 2, 2022 12:3561,446548,290,73020,758,0001,977,0002,285,568
5Aug 2, 2022 12:3561,503557,207,69921,767,000989,0002,281,472
6Aug 2, 2022 12:3561,508552,627,05921,769,000989,0002,285,568
7Aug 2, 2022 12:3561,527552,616,59120,786,0001,979,0002,281,472
8Aug 2, 2022 12:3561,530553,642,21121,777,000989,0002,289,664
9Aug 2, 2022 12:3561,546549,947,02121,782,000990,0002,289,664
10Aug 2, 2022 12:3564,466584,271,19823,852,25002,252,800
11Aug 2, 2022 12:3564,477584,718,74623,856,35202,269,184
12Aug 2, 2022 12:3566,751587,915,94324,697,82002,252,800