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 21:35Josu 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 21:35047,408,92636,584,0001,006,0002,113,536expected "53693121885402170 ", got "53693121843425805 "
2May 11, 2026 21:354,43344,840,70835,774,0001,023,0002,113,536
3May 11, 2026 21:354,50644,790,99436,376,0001,025,0002,113,536
4May 11, 2026 21:354,52546,916,67936,521,0001,041,0002,113,536
5May 11, 2026 21:354,53446,859,04036,589,0001,045,0002,113,536
6May 11, 2026 21:354,53445,479,71336,592,0001,041,0002,113,536
7May 11, 2026 21:354,55948,307,87136,802,0001,039,0002,113,536
8May 11, 2026 21:354,58646,296,56537,049,0001,020,0002,113,536
9May 11, 2026 21:354,59045,560,65437,088,0001,009,0002,113,536