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 10:03Andrey TsvetkovAndrey TsvetkovScore: 288,478Success
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 10:03288,425168,621,564106,717,11502,203,648
2Jul 13, 2021 10:03288,478176,096,253106,736,74602,203,648
3Jul 13, 2021 10:03291,342176,535,823107,796,37702,220,032