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:34Yuriy LyfenkoYuriy LyfenkoError
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:3400000Error: expected "429496467490 ", got "416611580723 "stderr
2Jul 8, 2021 12:3478,24098,863,41328,948,63402,265,088
3Jul 8, 2021 12:3478,29683,631,19128,969,53302,269,184
4Jul 8, 2021 12:3478,42399,632,87629,016,52202,252,800