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 22:12Yuriy LyfenkoYuriy LyfenkoScore: 67,515Success
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 22:1267,331578,655,32124,912,63402,248,704
2Jul 8, 2021 22:1267,515584,189,67624,980,60302,240,512
3Jul 8, 2021 22:1267,531580,251,67624,986,36202,248,704