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:04E SequeiraE SequeiraScore: 122,032Success
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:04121,68969,055,99643,024,0002,001,0002,326,528
2May 26, 2025 07:04122,03276,074,28743,146,0002,006,0002,322,432
3May 26, 2025 07:04124,04377,903,78443,901,0001,995,0002,326,528