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 11, 2025 22:58cures1cures1Score: 1,990,333Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2025 22:581,985,78616,509,593,78816,417,054,00064,972,0002,277,376
2May 11, 2025 22:581,987,23716,531,165,01316,439,087,00054,976,0002,285,568
3May 11, 2025 22:581,989,31416,541,961,90016,450,334,00060,971,0002,277,376
4May 11, 2025 22:581,989,78116,543,863,17216,455,205,00059,975,0002,277,376
5May 11, 2025 22:581,990,33316,554,816,13716,465,792,00053,973,0002,285,568
6May 11, 2025 22:581,991,80816,562,211,14216,446,045,00085,958,0002,289,664
7May 11, 2025 22:581,993,50716,579,916,69016,463,139,00082,965,0002,285,568
8May 11, 2025 22:581,999,72316,632,112,55716,524,730,00072,972,0002,285,568
9May 11, 2025 22:582,016,22516,766,628,57916,669,696,00064,975,0002,289,664