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 listNov 9, 2024 16:20Nacho NievaNacho NievaScore: 263,999Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 9, 2024 16:20263,8572,221,024,3582,101,053,00088,959,0002,330,624
2Nov 9, 2024 16:20263,9052,220,595,6832,087,441,000102,972,0002,326,528
3Nov 9, 2024 16:20263,9632,225,791,7302,087,949,000102,948,0002,326,528
4Nov 9, 2024 16:20263,9662,221,945,5712,088,970,000101,949,0002,326,528
5Nov 9, 2024 16:20263,9992,219,871,9312,098,271,00092,923,0002,326,528
6Nov 9, 2024 16:20264,0062,213,382,3162,091,287,00099,965,0002,326,528
7Nov 9, 2024 16:20264,0232,215,789,7222,102,416,00088,975,0002,326,528
8Nov 9, 2024 16:20264,0572,227,677,7202,103,723,00087,946,0002,326,528
9Nov 9, 2024 16:20264,8402,221,886,2912,116,241,00081,931,0002,326,528