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 19, 2025 15:39Rachel TanRachel TanScore: 260,489Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 19, 2025 15:39260,2112,190,149,5282,097,784,00061,964,0002,285,568
2May 19, 2025 15:39260,2372,183,460,3722,084,006,00075,963,0002,359,296
3May 19, 2025 15:39260,3392,192,475,5912,097,846,00062,965,0002,285,568
4May 19, 2025 15:39260,4712,190,045,9082,086,946,00074,962,0002,281,472
5May 19, 2025 15:39260,4892,192,204,8442,091,086,00070,969,0002,359,296
6May 19, 2025 15:39260,6032,190,365,4202,091,040,00071,966,0002,367,488
7May 19, 2025 15:39262,1412,199,504,2152,116,806,00058,966,0002,363,392
8May 19, 2025 15:39262,1502,204,082,0622,101,888,00073,960,0002,281,472
9May 19, 2025 15:39271,8552,286,675,4462,192,415,00063,982,0002,285,568