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 listOct 20, 2026 07:25e1011e1011Error
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 20, 2026 07:26046,074,45934,092,0001,101,0002,113,536expected "429496484192 ", got "429496492996 "
2Oct 20, 2026 07:26047,467,33833,858,0001,195,0002,113,536expected "429496546871 ", got "429496554509 "
3Oct 20, 2026 07:26047,186,47134,399,0001,206,0002,113,536expected "429496530627 ", got "429496538060 "