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 11, 2024 09:45ZOTTIGZOTTIGScore: 97,928Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 11, 2024 09:4597,835840,566,344746,032,00066,002,0002,359,296
2Nov 11, 2024 09:4597,871841,572,456742,385,00069,942,0002,326,528
3Nov 11, 2024 09:4597,891839,164,353748,539,00063,960,0002,408,448
4Nov 11, 2024 09:4597,902838,892,537742,621,00069,964,0002,330,624
5Nov 11, 2024 09:4597,928845,763,133745,817,00066,983,0002,424,832
6Nov 11, 2024 09:4598,004845,424,103745,480,00067,952,0002,289,664
7Nov 11, 2024 09:4599,116851,737,501754,689,00067,971,0002,301,952
8Nov 11, 2024 09:4599,210850,667,737753,491,00069,952,0002,338,816
9Nov 11, 2024 09:4599,358852,267,311752,698,00071,971,0002,326,528