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 18, 2026 18:49wnwnError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 6, 2026 23:01Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 23:01042,077,66432,259,0001,187,0002,113,536expected "74600294196621100 ", got "40759669570080812 "
2Jul 6, 2026 23:01041,903,35532,104,0001,178,0002,113,536expected "74600294196621100 ", got "40775636239948588 "
3Jul 6, 2026 23:01044,159,92134,430,0001,154,0002,113,536expected "74600294196621100 ", got "44547546693264940 "
4Mar 18, 2026 18:364,23553,398,58233,141,0002,008,0002,494,464
5Mar 18, 2026 18:364,23765,111,36533,162,0002,009,0002,273,280
6Mar 18, 2026 18:494,26056,574,44034,349,0001,010,0002,273,280
7Mar 18, 2026 18:364,27555,609,84334,470,0001,013,0002,494,464
8Mar 18, 2026 18:494,28057,491,74634,512,0001,015,0002,498,560
9Mar 18, 2026 18:494,29458,667,97234,622,0001,018,0002,273,280