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 23:59Yuriy LyfenkoYuriy LyfenkoScore: 152,706Success
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 23:59135,335967,678,12850,073,936059,142,144
2Jul 7, 2021 23:59152,7061,008,222,30156,501,254061,370,368
3Jul 7, 2021 23:59159,1821,082,156,21058,897,419066,875,392