Parse integers Sergey Svistunov

Compute the sum of integers read from STDIN as fast as possible.

Input: 50 000 000 lines, each containing one integer in the range [0; 2147483647].

629871117
2024562523
1372689083
1021777120
2111176472

Output: The uint64 sum of all numbers, printed as a decimal string.

Note: Integer overflow is expected – use a 64-bit accumulator.

Back to listSep 6, 2026 12:16Kevin HeaveyKevin HeaveyScore: 3,614Success
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 7, 2026 03:46Andrew Ashworth10.00CustomSolution Held
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 6, 2026 12:193,50937,622,39327,939,0001,192,0002,113,536
2Sep 6, 2026 12:193,52637,788,17228,128,0001,141,0002,113,536
3Sep 6, 2026 12:193,53137,821,71428,102,0001,206,0002,113,536
4Sep 6, 2026 12:193,53337,877,86828,137,0001,194,0002,113,536
5Sep 6, 2026 12:193,61438,762,54028,806,0001,195,0002,113,536
6Sep 6, 2026 12:193,66738,979,87929,405,0001,036,0002,113,536
7Sep 6, 2026 12:193,69039,192,70529,451,0001,177,0002,113,536
8Sep 6, 2026 12:193,69239,223,42329,451,0001,199,0002,113,536
9Sep 6, 2026 12:193,70339,906,53829,542,0001,199,0002,113,536