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 25, 2025 15:33Giacomo StevanatoGiacomo StevanatoScore: 342,206Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 25, 2025 15:33338,8402,838,861,3292,811,375,000999,0002,375,680
2Jan 25, 2025 15:33339,7752,849,263,8092,818,135,0001,998,0002,293,760
3Jan 25, 2025 15:33340,3002,849,528,8742,823,495,000999,0002,285,568
4Jan 25, 2025 15:33340,9232,853,246,8352,828,661,000999,0002,293,760
5Jan 25, 2025 15:33342,2062,869,568,4452,838,315,0001,998,0002,293,760
6Jan 25, 2025 15:33345,0842,887,631,1552,860,200,0003,997,0002,289,664
7Jan 25, 2025 15:33346,6682,902,952,9752,873,349,0003,999,0002,293,760
8Jan 25, 2025 15:33347,3252,906,238,7122,881,796,000999,0002,469,888
9Jan 25, 2025 15:33350,0092,933,945,8172,904,078,000999,0002,285,568