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:50Yuriy LyfenkoYuriy LyfenkoScore: 63,419Success
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:5063,043546,609,86922,312,0001,014,0002,281,472
2Aug 2, 2022 12:5063,195545,841,46622,366,0001,016,0002,265,088
3Aug 2, 2022 12:5063,246545,873,74322,384,0001,017,0002,281,472
4Aug 2, 2022 12:5063,259548,097,39522,389,0001,017,0002,281,472
5Aug 2, 2022 12:5063,278548,839,92623,413,00002,281,472
6Aug 2, 2022 12:5063,381550,513,07422,432,0001,019,0002,273,280
7Aug 2, 2022 12:5063,419545,613,84822,445,0001,020,0002,281,472
8Aug 2, 2022 12:5063,422543,430,79622,446,0001,020,0002,277,376
9Aug 2, 2022 12:5063,524549,301,75422,483,0001,021,0002,289,664
10Aug 2, 2022 12:5064,119592,213,98823,724,05202,248,704
11Aug 2, 2022 12:5064,307588,966,64423,793,64302,273,280
12Aug 2, 2022 12:5064,433592,446,30523,840,26102,256,896