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 listFeb 4, 2025 06:58mebowlermebowlerScore: 82,530Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 4, 2025 06:5882,469710,385,720625,533,00058,956,0002,334,720
2Feb 4, 2025 06:5882,497717,576,258628,750,00055,977,0002,527,232
3Feb 4, 2025 06:5882,501709,499,698626,780,00057,979,0002,330,624
4Feb 4, 2025 06:5882,527711,181,682628,980,00055,998,0002,334,720
5Feb 4, 2025 06:5882,530709,612,331625,001,00060,000,0002,334,720
6Feb 4, 2025 06:5882,569713,789,412631,299,00054,025,0002,334,720
7Feb 4, 2025 06:5882,604708,165,962642,577,00043,038,0002,334,720
8Feb 4, 2025 06:5882,719716,749,718617,613,00068,956,0002,523,136
9Feb 4, 2025 06:5882,741707,983,751632,773,00053,980,0002,334,720