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 19:29Yuriy LyfenkoYuriy LyfenkoScore: 158,220Success
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 19:29158,012118,964,75058,464,54002,203,648
2Jul 8, 2021 19:29158,220112,837,80158,541,28502,195,456
3Jul 8, 2021 19:29159,056127,881,81658,850,89302,183,168