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 listApr 13, 2026 19:20Yuriy LyfenkoYuriy LyfenkoError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 7, 2026 02:41Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 02:42045,724,82635,616,0001,035,0002,117,632expected "74600294196621100 ", got "17101192389373740 "
2Jul 7, 2026 02:42044,988,59535,839,0001,035,0002,117,632expected "74600294196621100 ", got "15180987589373740 "
3Jul 7, 2026 02:42045,063,60036,086,0001,049,0002,117,632expected "74600294196621100 ", got "15180987589373740 "
4Apr 13, 2026 19:194,57565,459,81835,977,0001,998,0002,310,144
5Apr 13, 2026 19:194,58266,420,87036,028,0002,001,0002,273,280
6Apr 13, 2026 19:204,58759,667,88636,067,0002,003,0002,535,424
7Apr 13, 2026 19:204,60761,888,17036,229,0002,012,0002,310,144
8Apr 13, 2026 19:194,61258,666,86636,265,0002,014,0002,535,424
9Apr 13, 2026 19:204,61457,118,02436,280,0002,015,0002,531,328