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 11, 2026 03:50Josu 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 11, 2026 03:50040,306,23631,102,0001,093,0002,113,536expected "53683942390519577 ", got "53683942134519577 "
2May 11, 2026 03:50040,884,11731,217,0001,088,0002,113,536expected "53691609352324743 ", got "53691608658514865 "
3May 11, 2026 03:503,85842,279,93730,942,0001,086,0002,113,536
4May 11, 2026 03:503,85939,819,01230,931,0001,102,0002,113,536
5May 11, 2026 03:503,86239,645,71630,988,0001,069,0002,113,536
6May 11, 2026 03:503,86240,145,38730,971,0001,090,0002,113,536
7May 11, 2026 03:503,88342,154,58131,144,0001,091,0002,113,536
8May 11, 2026 03:503,91840,125,52931,433,0001,092,0002,113,536
9May 11, 2026 03:504,00143,550,63432,115,0001,100,0002,113,536