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 listOct 14, 2024 00:03Joad NacerJoad NacerScore: 4,648Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 14, 2024 00:034,45363,608,49735,965,000999,0002,273,280
2Oct 14, 2024 00:114,47660,373,54435,146,0002,008,0002,297,856
3Oct 14, 2024 00:114,47763,638,13636,158,0001,004,0002,535,424
4Oct 14, 2024 00:114,51259,093,54234,410,0003,036,0002,273,280
5Oct 14, 2024 00:114,53060,195,88337,595,00002,297,856
6Oct 14, 2024 00:034,58961,629,05836,081,0002,004,0002,531,328
7Oct 14, 2024 00:114,64859,410,19638,580,00002,531,328
8Oct 14, 2024 00:034,64967,278,49737,570,0001,015,0002,531,328
9Oct 14, 2024 00:034,68761,143,04536,911,0001,995,0002,527,232
10Oct 14, 2024 00:034,70360,676,88336,030,0003,002,0002,392,064
11Oct 14, 2024 00:034,82861,513,04337,069,0003,005,0002,535,424
12Oct 14, 2024 00:114,86060,889,44538,268,0002,068,0002,297,856