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:35boomboomturtleboomboomturtleScore: 369,088Success
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:35366,5233,075,921,9012,967,186,00074,954,0002,285,568
2May 17, 2025 05:35367,4003,080,379,9912,983,459,00065,965,0002,285,568
3May 17, 2025 05:35368,7733,089,622,5182,993,864,00066,952,0002,281,472
4May 17, 2025 05:35368,9353,093,262,0182,991,200,00070,957,0002,285,568
5May 17, 2025 05:35369,0883,091,132,8942,996,463,00066,965,0002,363,392
6May 17, 2025 05:35369,6353,097,279,9583,015,009,00052,965,0002,289,664
7May 17, 2025 05:35369,6473,098,597,7773,001,095,00066,979,0002,289,664
8May 17, 2025 05:35378,8433,176,783,4393,070,434,00073,962,0002,281,472
9May 17, 2025 05:35591,7784,939,204,8054,848,784,00062,971,0002,281,472