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 15:34Yuriy LyfenkoYuriy LyfenkoError
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 15:3400000Error: expected "429496481468 ", got "420906557001 "
2Jul 13, 2021 15:34109,459107,697,84540,499,69502,187,264
3Jul 13, 2021 15:34109,466101,329,18640,502,60202,191,360
4Jul 13, 2021 15:34109,895117,071,66640,661,18502,183,168