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 06:11wnwnError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 6, 2026 18:09Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 18:09039,548,82930,517,0001,036,0002,113,536expected "74600294196621100 ", got "74534437448416060 "
2Jul 6, 2026 18:09043,802,40234,793,0001,017,0002,113,536expected "74600294196621100 ", got "74535239384179300 "
3Jul 6, 2026 18:09039,404,88830,410,0001,018,0002,113,536expected "74600294196621100 ", got "74534439383878490 "
4Apr 19, 2026 06:123,78450,299,54230,395,0001,013,0002,498,560
5Apr 19, 2026 06:113,80056,804,68630,524,0001,017,0002,531,328
6Apr 19, 2026 06:123,80157,880,40430,532,0001,017,0002,506,752
7Apr 19, 2026 06:113,83956,697,64929,873,0001,991,0002,269,184
8Apr 19, 2026 06:123,93663,738,21731,651,0001,021,0002,494,464
9Apr 19, 2026 06:113,95564,189,87331,836,000994,0002,494,464