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 listAug 9, 2021 07:01MaratMaratScore: 500,533Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 9, 2021 13:05497,7354,193,527,9494,131,200,81302,199,552
2Aug 9, 2021 07:01498,1484,203,457,5884,134,629,79902,199,552
3Aug 9, 2021 13:05499,1344,215,547,0244,142,808,05702,195,456
4Aug 9, 2021 07:01500,5334,213,941,6114,154,424,20302,256,896
5Aug 9, 2021 13:05501,4304,216,774,8074,161,867,00202,281,472
6Aug 9, 2021 07:01505,1974,255,079,5134,193,138,12902,211,840