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 listNov 11, 2024 09:53Anatoly ZhmurAnatoly ZhmurScore: 82,754Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 11, 2024 09:5382,718712,197,754636,590,00049,967,0002,543,616
2Nov 11, 2024 09:5382,731714,500,161627,696,00058,971,0002,543,616
3Nov 11, 2024 09:5382,749713,471,364627,832,00058,984,0002,445,312
4Nov 11, 2024 09:5382,754712,854,940636,866,00049,989,0002,465,792
5Nov 11, 2024 09:5382,754713,615,090627,874,00058,988,0002,301,952
6Nov 11, 2024 09:5382,756715,014,217631,885,00054,990,0002,449,408
7Nov 11, 2024 09:5382,784711,785,936631,096,00056,008,0002,531,328
8Nov 11, 2024 09:5382,855718,721,660628,724,00058,974,0002,301,952
9Nov 11, 2024 09:5382,876711,836,851633,879,00053,989,0002,453,504