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 17:22Yuriy LyfenkoYuriy LyfenkoScore: 105,303Success
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 17:22104,928111,181,05238,823,52902,187,264
2Jul 13, 2021 17:22105,303110,406,08638,962,08202,183,168
3Jul 13, 2021 17:22106,205102,255,93939,295,97302,183,168