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 listApr 20, 2026 13:09Dominique GarmierDominique GarmierError
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 20, 2026 13:09056,298,25623,952,0001,996,0002,375,680expected "429496515355 ", got "360777042313 "
2Apr 20, 2026 13:09051,538,92124,019,0002,001,0002,379,776expected "429496442820 ", got "360776974337 "
3Apr 20, 2026 13:09055,217,18725,065,0001,002,0002,375,680expected "429496491818 ", got "360777020837 "