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 23, 2026 11:39Dominique GarmierDominique GarmierScore: 73,767Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 23, 2026 11:4073,41844,080,41525,153,0002,012,0002,375,680
2Apr 23, 2026 11:4073,54342,688,60826,204,0001,007,0002,383,872
3Apr 23, 2026 11:4073,60245,281,36526,225,0001,008,0002,375,680
4Apr 23, 2026 11:4073,63243,137,98926,235,0001,009,0002,375,680
5Apr 23, 2026 11:4073,76745,649,64927,294,00002,383,872
6Apr 23, 2026 11:4073,95141,361,46426,349,0001,013,0002,375,680
7Apr 23, 2026 11:4074,07545,696,39826,393,0001,015,0002,371,584
8Apr 23, 2026 11:4074,12741,547,61827,427,00002,326,528
9Apr 23, 2026 11:4074,13243,698,31526,414,0001,015,0002,461,696