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:46Yuriy LyfenkoYuriy LyfenkoScore: 74,482Success
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:4674,162594,640,67827,440,12302,240,512
2Jul 8, 2021 12:4674,482588,298,32327,558,30602,260,992
3Jul 8, 2021 12:4674,614584,842,97927,607,32302,244,608