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 13, 2021 17:18Yuriy LyfenkoYuriy LyfenkoScore: 103,519Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 13, 2021 17:18102,34366,895,26634,878,0002,989,0002,527,232
2Jul 13, 2021 17:18102,56862,601,75134,954,0002,996,0002,334,720
3Jul 13, 2021 17:18102,59265,920,75935,962,0001,997,0002,334,720
4Jul 13, 2021 17:18102,67060,596,69234,989,0002,999,0002,527,232
5Jul 13, 2021 17:18102,83066,296,92035,044,0003,003,0002,334,720
6Jul 13, 2021 17:18102,84965,173,84836,052,0002,002,0002,523,136
7Jul 13, 2021 17:18103,51963,236,25135,279,0003,023,0002,523,136
8Jul 13, 2021 17:18103,63066,081,25136,325,0002,018,0002,527,232
9Jul 13, 2021 17:18104,19262,684,43837,537,0001,014,0002,334,720
10Jul 13, 2021 17:18104,74099,488,38238,753,80702,187,264
11Jul 13, 2021 17:18105,173102,606,67038,913,94002,183,168
12Jul 13, 2021 17:18106,170105,858,93439,282,98302,191,360