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:49Yuriy LyfenkoYuriy LyfenkoScore: 61,546Success
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:4961,141551,035,16921,594,0001,028,0002,281,472
2Aug 2, 2022 12:4961,173547,797,74121,650,000984,0002,281,472
3Aug 2, 2022 12:4961,470549,558,89721,756,000988,0002,281,472
4Aug 2, 2022 12:4961,492549,227,31820,774,0001,978,0002,281,472
5Aug 2, 2022 12:4961,530555,034,80622,766,00002,269,184
6Aug 2, 2022 12:4961,535551,042,65321,779,000989,0002,281,472
7Aug 2, 2022 12:4961,546549,841,78921,782,000990,0002,289,664
8Aug 2, 2022 12:4961,549550,516,82620,793,0001,980,0002,281,472
9Aug 2, 2022 12:4961,732544,615,90021,803,0001,038,0002,285,568
10Aug 2, 2022 12:4964,111581,188,17423,721,24002,248,704
11Aug 2, 2022 12:4964,386587,227,98723,822,95802,248,704
12Aug 2, 2022 12:4964,515578,856,20423,870,55702,269,184