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 listJul 8, 2021 02:00Yuriy LyfenkoYuriy LyfenkoScore: 1,089,583Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 8, 2021 02:00320,9931,068,003,833118,767,473059,277,312
2Jul 8, 2021 01:56330,7171,084,036,105122,365,460061,386,752
3Jul 8, 2021 02:00338,6751,147,361,085125,309,837061,259,776
4Jul 8, 2021 02:00339,2181,052,394,713125,510,622060,973,056
5Jul 8, 2021 01:56341,5801,090,131,684126,384,687060,968,960
6Jul 8, 2021 01:56351,5301,091,702,283130,065,938062,152,704
7Jul 8, 2021 02:001,089,583979,746,249403,145,73402,306,048
8Jul 8, 2021 01:562,880,7911,629,394,9191,065,892,64802,318,336
9Jul 8, 2021 01:568,979,1983,892,914,1073,322,303,09702,281,472
10Jul 8, 2021 02:009,413,2374,042,858,0973,482,897,52502,199,552
11Jul 8, 2021 02:0012,623,8215,223,932,8514,670,813,72602,314,240
12Jul 8, 2021 01:5612,915,5375,343,279,0644,778,748,77702,199,552