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 19:18Josu 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 19:18041,381,41931,054,0001,069,0002,113,536expected "53686539369973481 ", got "53686538322803324 "
2May 10, 2026 19:18041,532,63430,932,0001,083,0002,113,536expected "53685266496505066 ", got "53685483857905397 "
3May 10, 2026 19:183,87639,649,37331,099,0001,077,0002,113,536
4May 10, 2026 19:183,87740,878,75631,090,0001,094,0002,113,536
5May 10, 2026 19:183,87941,464,23631,124,0001,079,0002,113,536
6May 10, 2026 19:183,88242,956,56131,153,0001,073,0002,113,536
7May 10, 2026 19:183,89440,230,08731,263,0001,065,0002,113,536
8May 10, 2026 19:183,89942,220,56531,273,0001,096,0002,113,536
9May 10, 2026 19:183,93641,277,91631,596,0001,078,0002,113,536