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 18:37Josu San MartinJosu San MartinScore: 3,983Success
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 18:373,94140,352,11431,700,0001,014,0002,113,536
2May 10, 2026 18:373,94942,859,42331,693,0001,091,0002,113,536
3May 10, 2026 18:373,95740,096,89331,750,0001,095,0002,113,536
4May 10, 2026 18:373,96642,617,43731,756,0001,166,0002,113,536
5May 10, 2026 18:373,98341,535,53732,036,0001,028,0002,113,536
6May 10, 2026 18:373,99142,604,91832,047,0001,083,0002,113,536
7May 10, 2026 18:373,99841,708,83132,121,0001,065,0002,113,536
8May 10, 2026 18:374,00643,130,56332,179,0001,073,0002,113,536
9May 10, 2026 18:374,09541,146,24832,958,0001,035,0002,113,536