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 1, 2021 17:41Vitaliy F.Vitaliy F.Score: 123,309Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 1, 2021 17:41123,1661,077,201,8451,022,274,78602,211,840
2Jul 1, 2021 17:42123,2981,083,880,4571,023,371,22902,207,744
3Jul 1, 2021 17:42123,3051,087,945,1841,023,428,60102,203,648
4Jul 1, 2021 17:41123,3091,090,589,5191,023,466,18902,211,840
5Jul 1, 2021 17:42123,3111,083,400,7071,023,478,76802,207,744
6Jul 1, 2021 17:41123,8551,100,143,2671,027,995,74902,215,936