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 listMay 17, 2025 05:59boomboomturtleboomboomturtleScore: 368,505Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2025 05:59367,1103,071,066,7132,944,051,000102,966,0002,281,472
2May 17, 2025 05:59367,2243,075,302,4032,949,026,00098,933,0002,281,472
3May 17, 2025 05:59367,2753,074,840,2352,976,419,00071,961,0002,285,568
4May 17, 2025 05:59367,6183,077,397,0632,982,271,00068,960,0002,359,296
5May 17, 2025 05:59368,5053,082,480,5202,998,617,00059,972,0002,285,568
6May 17, 2025 05:59369,2173,088,666,7293,002,536,00061,969,0002,281,472
7May 17, 2025 05:59369,9753,095,002,9623,003,818,00066,973,0002,281,472
8May 17, 2025 05:59370,3223,099,618,9703,004,705,00068,970,0002,281,472
9May 17, 2025 05:59370,6613,104,194,1132,996,526,00079,960,0002,281,472