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 7, 2021 21:26Yuriy LyfenkoYuriy LyfenkoScore: 893,587Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2021 21:26246,744556,450,84891,295,464059,088,896
2Jul 7, 2021 21:26248,314552,136,96691,876,293060,850,176
3Jul 7, 2021 21:26252,013524,000,99493,244,804058,888,192
4Jul 7, 2021 21:26893,587401,683,230330,627,05302,228,224
5Jul 7, 2021 21:2617,120,6236,400,060,0676,334,630,67202,203,648
6Jul 7, 2021 21:2621,699,7978,114,600,1278,028,925,01802,187,264