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 31, 2026 14:46Yuriy LyfenkoYuriy LyfenkoError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 7, 2026 03:27Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 03:28045,699,40936,159,0001,256,0002,117,632expected "74600294196621100 ", got "15171666185858860 "
2Jul 7, 2026 03:28045,254,61336,119,0001,201,0002,117,632expected "74600294196621100 ", got "14969816034029356 "
3Jul 7, 2026 03:28048,579,45836,300,0001,120,0002,117,632expected "74600294196621100 ", got "16895846256258860 "
4Mar 31, 2026 14:464,62668,488,36037,388,0001,010,0002,535,424
5Mar 31, 2026 14:464,88260,213,76939,506,0001,012,0002,461,696
6Mar 31, 2026 14:464,89363,919,86339,600,0001,015,0002,465,792