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 listOct 11, 2024 01:32Joad NacerJoad NacerScore: 4,601Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 11, 2024 01:324,52767,815,82934,524,0003,046,0002,334,720
2Oct 11, 2024 01:324,55662,935,81835,822,0001,990,0002,334,720
3Oct 11, 2024 01:324,55762,259,88034,840,0002,986,0002,334,720
4Oct 11, 2024 01:324,60156,981,68136,176,0002,009,0002,330,624
5Oct 11, 2024 01:324,61368,595,57635,265,0003,022,0002,330,624
6Oct 11, 2024 01:324,63167,424,09336,413,0002,022,0002,514,944