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:25Yuriy LyfenkoYuriy LyfenkoScore: 98,467Success
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:2598,04899,938,98336,277,78902,187,264
2Jul 13, 2021 17:2598,46796,427,97636,432,68902,187,264
3Jul 13, 2021 17:2598,879104,473,48336,585,15702,187,264