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 12:15Yuriy LyfenkoYuriy LyfenkoScore: 89,454Success
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 12:1588,92888,418,68032,903,53302,260,992
2Jul 8, 2021 12:1589,45498,662,83633,098,04202,265,088
3Jul 8, 2021 12:1590,170109,143,07033,362,86202,269,184