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 listMay 9, 2026 14:34wnwnScore: 3,407Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 9, 2026 14:353,37244,723,51526,935,0001,057,0002,486,272
2May 9, 2026 14:353,37845,470,50226,975,0001,066,0002,490,368
3May 9, 2026 14:353,38242,736,95427,035,0001,043,0002,486,272
4May 9, 2026 14:353,38942,111,24327,045,0001,086,0002,490,368
5May 9, 2026 14:353,40743,720,79327,203,0001,077,0002,482,176
6May 9, 2026 14:353,41142,368,94127,196,0001,116,0002,330,624
7May 9, 2026 14:353,51443,684,28828,102,0001,070,0002,478,080
8May 9, 2026 14:353,55746,945,77728,431,0001,094,0002,482,176
9May 9, 2026 14:353,58145,676,53928,649,0001,074,0002,486,272