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 19, 2026 04:06wnwnError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 6, 2026 21:14Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 21:15042,555,34333,475,0001,010,0002,113,536expected "74600294196621100 ", got "74534439650330820 "
2Jul 6, 2026 21:15042,649,18931,861,0001,029,0002,113,536expected "74600294196621100 ", got "74534441005506840 "
3Jul 6, 2026 21:15042,540,31433,304,0001,008,0002,113,536expected "74600294196621100 ", got "74534440614725170 "
4Apr 19, 2026 04:074,10059,801,46133,030,0001,000,0002,498,560
5Apr 19, 2026 04:074,10558,824,71832,065,0002,004,0002,531,328
6Apr 19, 2026 04:064,13559,142,94733,312,0001,009,0002,531,328
7Apr 19, 2026 04:064,20959,459,92132,937,0001,996,0002,494,464
8Apr 19, 2026 04:074,21359,023,70832,968,0001,998,0002,531,328
9Apr 19, 2026 04:064,22360,386,94233,047,0002,002,0002,486,272