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 listJan 2, 2025 13:40scompa18scompa18Score: 82,586Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 2, 2025 13:4082,026705,372,148461,877,000218,941,0002,478,080
2Jan 2, 2025 13:4082,313706,811,756461,456,000221,739,0002,457,600
3Jan 2, 2025 13:4082,375712,068,409464,804,000218,908,0002,461,696
4Jan 2, 2025 13:4082,586708,503,946463,639,000221,827,0002,420,736
5Jan 2, 2025 13:4082,647716,672,745463,979,000221,990,0002,293,760
6Jan 2, 2025 13:4082,654709,845,774465,019,000221,009,0002,453,504