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 16, 2024 23:45Joad NacerJoad NacerScore: 4,582Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 16, 2024 23:454,51462,742,87136,458,0001,012,0002,535,424
2Oct 16, 2024 23:454,56369,641,18635,883,0001,993,0002,273,280
3Oct 16, 2024 23:454,57864,073,54235,997,0001,999,0002,269,184
4Oct 16, 2024 23:454,58259,301,88637,031,0001,000,0002,531,328
5Oct 16, 2024 23:454,63661,458,81437,469,0001,012,0002,301,952
6Oct 16, 2024 23:454,73760,595,39338,313,0001,008,0002,531,328