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 19:08Yuriy LyfenkoYuriy LyfenkoScore: 61,562Success
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 19:0861,419548,500,21820,749,0001,976,0002,281,472
2Aug 2, 2022 19:0861,522550,803,98120,784,0001,979,0002,289,664
3Aug 2, 2022 19:0861,535547,361,43221,779,000989,0002,273,280
4Aug 2, 2022 19:0861,543555,179,16820,791,0001,980,0002,273,280
5Aug 2, 2022 19:0861,543552,063,50120,791,0001,980,0002,281,472
6Aug 2, 2022 19:0861,554547,694,29320,795,0001,980,0002,289,664
7Aug 2, 2022 19:0861,562553,508,67021,788,000990,0002,281,472
8Aug 2, 2022 19:0861,697545,991,71520,843,0001,985,0002,281,472
9Aug 2, 2022 19:0861,735542,616,10620,856,0001,986,0002,289,664
10Aug 2, 2022 19:0864,100589,349,67623,716,82802,269,184
11Aug 2, 2022 19:0864,213592,596,12023,758,91902,248,704
12Aug 2, 2022 19:0864,284589,650,95023,785,09502,248,704