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 listDec 4, 2025 13:37Rajarshi BasuRajarshi BasuScore: 8,586Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 4, 2025 13:378,35193,847,84867,307,0002,009,0002,498,560
2Dec 4, 2025 13:378,35796,031,36368,357,0001,005,0002,490,368
3Dec 4, 2025 13:378,426100,020,86967,937,0001,998,0002,498,560
4Dec 4, 2025 13:378,58695,413,52470,259,0001,003,0002,289,664
5Dec 4, 2025 13:378,62697,416,84070,587,0001,008,0002,326,528
6Dec 4, 2025 13:378,63398,478,04170,641,0001,009,0002,498,560