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:58Yuriy LyfenkoYuriy LyfenkoError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 7, 2026 01:32Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 01:32043,384,56134,306,0001,146,0002,117,632expected "74600294196621100 ", got "20786187000852268 "
2Jul 7, 2026 01:32043,498,90234,445,0001,169,0002,117,632expected "74600294196621100 ", got "20786187000852268 "
3Jul 7, 2026 01:32043,258,80134,301,0001,022,0002,117,632expected "74600294196621100 ", got "22348441450622764 "
4Apr 18, 2026 15:584,40861,163,18235,573,0001,016,0002,273,280
5Apr 18, 2026 15:584,40863,454,43535,569,0001,016,0002,473,984
6Apr 18, 2026 15:584,50655,342,60235,378,0002,021,0002,273,280