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 22, 2022 03:04zhiayangzhiayangScore: 41,136Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 22, 2022 03:0438,956389,552,208323,335,19802,273,280
2Aug 22, 2022 03:0441,084410,823,209341,000,46202,277,376
3Aug 22, 2022 03:0441,130410,538,089341,379,13502,281,472
4Aug 22, 2022 03:0441,136392,826,982341,430,16702,306,048
5Aug 22, 2022 03:0441,145397,826,006341,507,36502,273,280
6Aug 22, 2022 03:0441,146405,147,809341,512,55902,269,184