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 11:11Josu 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 11:12053,404,44633,045,0001,128,0002,482,176expected "53686923955011973 ", got "53686933645631576 "
2May 10, 2026 11:124,10549,386,11932,960,0001,117,0002,482,176
3May 10, 2026 11:124,14151,242,67733,311,0001,061,0002,482,176
4May 10, 2026 11:124,14147,628,41633,342,0001,035,0002,490,368
5May 10, 2026 11:124,15749,018,83033,471,0001,033,0002,490,368
6May 10, 2026 11:124,16350,174,76533,394,0001,167,0002,486,272
7May 10, 2026 11:124,16552,029,86533,501,0001,071,0002,482,176
8May 10, 2026 11:124,19648,368,23333,807,0001,028,0002,486,272
9May 10, 2026 11:124,20749,236,97833,812,0001,108,0002,478,080