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 7, 2025 16:22rogue *rogue *Score: 737,019Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 7, 2025 16:22736,8736,143,719,4816,052,075,00063,969,0002,277,376
2May 7, 2025 16:22736,9356,144,336,8706,053,588,00062,974,0002,277,376
3May 7, 2025 16:22736,9736,142,370,7156,043,916,00072,962,0002,277,376
4May 7, 2025 16:22736,9816,147,820,9666,043,982,00072,963,0002,277,376
5May 7, 2025 16:22737,0196,145,950,2896,055,288,00061,972,0002,277,376
6May 7, 2025 16:22737,0296,144,060,3216,056,368,00060,973,0002,277,376
7May 7, 2025 16:22737,0526,146,552,7686,046,562,00070,971,0002,289,664
8May 7, 2025 16:22737,1316,147,242,8136,050,222,00067,968,0002,265,088
9May 7, 2025 16:22757,0776,312,400,8886,215,771,00067,964,0002,277,376