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 14:59Yuriy LyfenkoYuriy LyfenkoScore: 131,916Success
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 14:59131,36276,918,44847,592,0001,012,0002,334,720
2Jul 13, 2021 14:59131,39274,404,97646,590,0002,025,0002,334,720
3Jul 13, 2021 14:59131,45173,056,62447,624,0001,013,0002,334,720
4Jul 13, 2021 14:59131,48174,617,67146,621,0002,027,0002,334,720
5Jul 13, 2021 14:59131,49278,047,35247,639,0001,013,0002,519,040
6Jul 13, 2021 14:59131,69281,398,28247,711,0001,015,0002,514,944
7Jul 13, 2021 14:59131,91675,839,42246,817,0001,992,0002,519,040
8Jul 13, 2021 14:59131,93875,652,14446,825,0001,992,0002,523,136
9Jul 13, 2021 14:59131,97076,063,78946,836,0001,993,0002,322,432
10Jul 13, 2021 14:59133,764106,219,30949,492,71202,187,264
11Jul 13, 2021 14:59134,015115,313,61149,585,71402,183,168
12Jul 13, 2021 14:59134,215117,062,42449,659,49702,179,072