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 listMar 19, 2025 10:45Brandon TangBrandon TangScore: 53,277Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 19, 2025 10:4553,233466,053,226438,836,0002,998,0002,289,664
2Mar 19, 2025 10:4553,242465,005,325439,907,0001,999,0002,289,664
3Mar 19, 2025 10:4553,250462,915,198439,972,0001,999,0002,379,776
4Mar 19, 2025 10:4553,253470,525,794440,002,0002,000,0002,265,088
5Mar 19, 2025 10:4553,277471,831,457442,195,00002,281,472
6Mar 19, 2025 10:4553,278462,735,530440,208,0002,000,0002,289,664
7Mar 19, 2025 10:4553,281465,816,030441,236,0001,000,0002,265,088
8Mar 19, 2025 10:4553,300472,111,419441,396,000998,0002,523,136
9Mar 19, 2025 10:4553,302474,086,931441,406,0001,000,0002,289,664