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 21:14Andrey TsvetkovAndrey TsvetkovScore: 1,914,637Success
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 21:141,914,606764,530,255708,404,30602,195,456
2Jul 13, 2021 21:141,914,637766,705,846708,415,71802,207,744
3Jul 13, 2021 21:141,914,697778,347,253708,437,96302,211,840