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 13:17Yuriy LyfenkoYuriy LyfenkoScore: 74,517Success
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 13:1774,305597,827,49227,492,92602,248,704
2Jul 8, 2021 13:1774,517596,394,28427,571,33402,252,800
3Jul 8, 2021 13:1774,611583,094,47227,605,99502,244,608