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 listMay 26, 2025 07:11E SequeiraE SequeiraScore: 87,241Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 26, 2025 07:1186,99756,841,60031,184,0001,005,0002,265,088
2May 26, 2025 07:1187,24157,014,53230,262,0002,017,0002,265,088
3May 26, 2025 07:1187,26858,033,05730,271,0002,018,0002,269,184