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 18:50Yurkov AlekseyYurkov AlekseyScore: 1,656,183Success
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 18:501,378,201575,359,058509,934,21102,240,512
2Jul 8, 2021 18:491,449,228612,685,080536,214,24802,293,760
3Jul 8, 2021 18:491,637,255657,742,386605,784,21002,224,128
4Jul 8, 2021 18:501,656,183684,064,371612,787,79402,306,048
5Jul 8, 2021 18:501,886,796756,330,708698,114,54002,297,856
6Jul 8, 2021 18:492,039,701817,864,440754,689,33102,297,856