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 18, 2026 15:45Yuriy LyfenkoYuriy LyfenkoError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 7, 2026 03:13Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 03:13045,703,20836,530,0001,099,0002,117,632expected "74600294196621100 ", got "17101192389373740 "
2Jul 7, 2026 03:13045,695,36736,525,0001,016,0002,117,632expected "74600294196621100 ", got "17101192389373740 "
3Jul 7, 2026 03:13045,767,41236,850,0001,021,0002,117,632expected "74600294196621100 ", got "17101192389373740 "
4Apr 18, 2026 15:454,68361,777,90037,873,000996,0002,531,328
5Apr 18, 2026 15:454,71358,064,30537,116,0002,006,0002,465,792
6Apr 18, 2026 15:454,71957,879,56137,156,0002,008,0002,473,984