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 listMay 10, 2026 08:56Josu San MartinJosu San MartinError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2026 08:56051,778,82833,185,0001,154,0002,494,464expected "53691062437193147 ", got "53691062369144769 "
2May 10, 2026 08:564,14349,920,92233,262,0001,132,0002,482,176
3May 10, 2026 08:564,14747,579,03433,315,0001,112,0002,482,176
4May 10, 2026 08:564,14951,247,92733,316,0001,126,0002,486,272
5May 10, 2026 08:564,15947,825,11233,492,0001,030,0002,482,176
6May 10, 2026 08:564,16150,232,71333,519,0001,025,0002,490,368
7May 10, 2026 08:564,16449,345,93633,539,0001,025,0002,494,464
8May 10, 2026 08:564,16548,550,91833,438,0001,137,0002,486,272
9May 10, 2026 08:564,16948,324,43033,578,0001,029,0002,478,080