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 13, 2026 03:25olliecrowolliecrowError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Apr 27, 2026 12:01wn13.51RecheckSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 27, 2026 12:01017,336,06401,260,000294,912Exit with code 1:
2Mar 13, 2026 03:252,83751,705,02923,546,00002,289,664
3Mar 13, 2026 03:252,84047,969,52822,548,0001,024,0002,277,376
4Mar 13, 2026 03:252,86352,282,80422,733,0001,033,0002,289,664
5Mar 13, 2026 03:252,88053,716,88321,915,0001,992,0002,289,664
6Mar 13, 2026 03:252,88546,568,23221,948,0001,995,0002,289,664
7Mar 13, 2026 03:252,88744,064,27121,964,0001,996,0002,289,664
8Mar 13, 2026 03:252,89246,968,85022,002,0002,000,0002,289,664
9Mar 13, 2026 03:252,89545,271,19722,025,0002,002,0002,387,968
10Mar 13, 2026 03:253,46257,537,49327,712,0001,026,0002,289,664