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 listJul 20, 2023 17:41gchebanovgchebanovScore: 16,282Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 20, 2023 17:4116,235160,032,667123,774,00010,980,0002,306,048
2Jul 20, 2023 17:4116,236161,306,543118,785,00015,971,0002,490,368
3Jul 20, 2023 17:4116,240161,380,323118,814,00015,975,0002,441,216
4Jul 20, 2023 17:4116,240169,101,548128,800,0005,990,0002,433,024
5Jul 20, 2023 17:4116,263161,441,196116,989,00017,998,0002,441,216
6Jul 20, 2023 17:4116,278163,598,186120,097,00015,012,0002,441,216
7Jul 20, 2023 17:4116,282156,792,458120,126,00015,015,0002,314,240
8Jul 20, 2023 17:4116,290160,183,379122,190,00013,020,0002,355,200
9Jul 20, 2023 17:4116,313156,890,415121,359,00014,041,0002,453,504
10Jul 20, 2023 17:4116,786204,325,154139,324,58302,207,744
11Jul 20, 2023 17:4116,799215,658,740139,428,53202,187,264
12Jul 20, 2023 17:4116,828206,870,836139,674,29202,195,456