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 17:28rogue *rogue *Score: 63,831Success
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 17:2863,685555,452,094475,630,00052,958,0002,273,280
2May 7, 2025 17:2863,747550,381,679475,087,00054,009,0002,273,280
3May 7, 2025 17:2863,780556,294,484471,332,00058,040,0002,392,064
4May 7, 2025 17:2863,791554,482,546476,517,00052,946,0002,273,280
5May 7, 2025 17:2863,831553,013,999471,818,00057,977,0002,387,968
6May 7, 2025 17:2863,964553,294,260470,911,00059,988,0002,383,872
7May 7, 2025 17:2863,997560,543,674471,153,00060,019,0002,273,280
8May 7, 2025 17:2864,103555,230,140471,049,00061,006,0002,273,280
9May 7, 2025 17:2864,383559,063,735473,335,00061,043,0002,506,752