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 listApr 13, 2024 16:40E SequeiraE SequeiraScore: 19,857Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 13, 2024 16:4019,739220,566,561163,836,33402,314,240
2Apr 13, 2024 16:4019,744233,150,891163,875,96202,326,528
3Apr 13, 2024 16:4019,823194,972,253162,523,0002,006,0002,519,040
4Apr 13, 2024 16:4019,828191,453,489163,570,0001,003,0002,519,040
5Apr 13, 2024 16:4019,850197,182,253161,759,0002,995,0002,519,040
6Apr 13, 2024 16:4019,854197,129,551164,785,00002,469,888
7Apr 13, 2024 16:4019,857188,627,692161,817,0002,996,0002,519,040
8Apr 13, 2024 16:4019,871195,768,171162,930,0001,999,0002,478,080
9Apr 13, 2024 16:4019,982220,366,920165,851,32802,318,336
10Apr 13, 2024 16:4020,062194,878,576165,514,0001,003,0002,519,040
11Apr 13, 2024 16:4020,342195,270,165167,843,000999,0002,519,040
12Apr 13, 2024 16:4020,452194,161,828168,757,000998,0002,519,040