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 13, 2026 19:51Yuriy LyfenkoYuriy LyfenkoError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
May 17, 2026 14:27M-Rochat10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 15:04023,042,61513,322,0001,023,0002,117,632expected "11318049299365247 ", got "6785642281111162 "
2May 17, 2026 15:04024,955,80013,391,0001,021,0002,117,632expected "11318049299365247 ", got "6785642281111162 "
3May 17, 2026 15:04024,991,43913,352,0001,029,0002,117,632expected "11318049299365247 ", got "6785642281111162 "
4Apr 13, 2026 19:514,28960,714,53334,581,0001,017,0002,469,888
5Apr 13, 2026 19:514,28959,832,43634,582,0001,017,0002,273,280
6Apr 13, 2026 19:514,31664,245,76833,834,0001,990,0002,535,424