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 26, 2023 23:15Matthew DowneyMatthew DowneyScore: 65,076Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 26, 2023 23:1565,042607,853,500539,850,33702,215,936
2Aug 26, 2023 23:1565,053599,799,046539,939,10702,203,648
3Aug 26, 2023 23:1565,053605,167,791539,940,04202,207,744
4Aug 26, 2023 23:1565,076599,620,590540,130,55302,207,744
5Aug 26, 2023 23:1565,082610,002,530540,176,63202,215,936
6Aug 26, 2023 23:1565,098607,343,702540,316,10602,211,840