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 listMar 21, 2026 07:19olliecrowolliecrowError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 7, 2026 05:47Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 05:47047,903,40937,258,0001,030,0002,117,632expected "74600294196621100 ", got "30383868655218476 "
2Jul 7, 2026 05:47047,606,53736,064,0002,010,0002,117,632expected "74600294196621100 ", got "31668388818759468 "
3Jul 7, 2026 05:47047,909,67637,315,0001,027,0002,117,632expected "74600294196621100 ", got "31668388818759468 "
4Mar 21, 2026 07:195,76174,217,79846,824,000996,0002,424,832
5Mar 21, 2026 07:195,79072,175,80544,050,0004,004,0002,453,504
6Mar 21, 2026 07:195,83369,732,36544,383,0004,034,0002,379,776