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 listMar 30, 2026 14:03Dominique GarmierDominique GarmierScore: 70,700Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 30, 2026 14:4970,55953,871,91224,099,0002,008,0002,469,888
2Mar 30, 2026 14:0370,59753,137,57225,117,0001,004,0002,347,008
3Mar 30, 2026 14:4970,60553,107,87225,120,0001,004,0002,289,664
4Mar 30, 2026 14:0370,70048,097,45124,147,0002,012,0002,363,392
5Mar 30, 2026 14:4970,87350,874,90224,206,0002,017,0002,289,664
6Mar 30, 2026 14:0370,94949,590,52024,232,0002,019,0002,367,488