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 8, 2021 20:03Yurkov AlekseyYurkov AlekseyScore: 144,216Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 8, 2021 20:03144,019107,685,55053,287,00502,273,280
2Jul 8, 2021 20:03144,216120,652,69453,359,94302,269,184
3Jul 8, 2021 20:03145,345115,994,38753,777,78102,256,896