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 listMay 23, 2025 12:14vahookvahookError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 7, 2026 02:37Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 02:38041,711,45631,446,0001,033,0002,113,536expected "74600294196621100 ", got "46425059381294892 "
2Jul 7, 2026 02:38041,465,64231,167,0002,182,0002,113,536expected "74600294196621100 ", got "46809649649023976 "
3Jul 7, 2026 02:38040,766,17531,766,0001,031,0002,113,536expected "74600294196621100 ", got "46926330510028914 "
4May 23, 2025 12:144,48663,414,38234,215,0003,019,0002,273,280
5May 23, 2025 12:144,52760,935,89534,526,0003,046,0002,273,280
6May 23, 2025 12:144,55963,047,27234,854,0002,987,0002,428,928
7May 23, 2025 12:144,57558,568,62633,977,0003,997,0002,420,736
8May 23, 2025 12:144,60461,990,22733,184,0005,028,0002,273,280
9May 23, 2025 12:144,62062,804,74533,301,0005,045,0002,273,280