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 9, 2026 02:29olliecrowolliecrowError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 7, 2026 05:25Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 05:26050,267,93539,771,0001,035,0002,113,536expected "74600294196621100 ", got "35715047309338156 "
2Jul 7, 2026 05:26048,576,43737,964,0001,023,0002,113,536expected "74600294196621100 ", got "53559696598368300 "
3Jul 7, 2026 05:26047,938,16737,256,0001,199,0002,113,536expected "74600294196621100 ", got "36631325982773292 "
4Mar 9, 2026 02:295,31169,939,03341,075,0003,005,0002,301,952
5Mar 9, 2026 02:295,40671,963,37443,874,000997,0002,387,968
6Mar 9, 2026 02:295,41474,496,02242,937,0001,997,0002,383,872
7Mar 9, 2026 02:295,67575,268,83743,096,0004,009,0002,449,408
8Mar 9, 2026 02:295,74372,866,88646,657,0001,014,0002,326,528
9Mar 9, 2026 02:295,75771,169,30743,804,0003,982,0002,465,792