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 listDec 29, 2022 10:45Bernard TeoBernard TeoScore: 6,039Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 29, 2022 10:456,01571,459,56947,927,0001,996,0002,387,968
2Dec 29, 2022 10:456,01673,754,26447,932,0001,997,0002,387,968
3Dec 29, 2022 10:456,03073,163,73249,027,0001,021,0002,392,064
4Dec 29, 2022 10:456,03171,426,75348,054,0002,002,0002,273,280
5Dec 29, 2022 10:456,03271,754,45048,062,0002,002,0002,404,352
6Dec 29, 2022 10:456,03873,504,87548,109,0002,004,0002,404,352
7Dec 29, 2022 10:456,03971,992,88848,117,0002,004,0002,396,160
8Dec 29, 2022 10:456,03976,934,42548,118,0002,004,0002,273,280
9Dec 29, 2022 10:456,04573,944,27649,167,0001,003,0002,269,184
10Dec 29, 2022 10:456,05474,668,45348,236,0002,009,0002,273,280
11Dec 29, 2022 10:456,430104,754,75053,369,64202,281,472
12Dec 29, 2022 10:456,431122,256,29953,374,68902,285,568
13Dec 29, 2022 10:456,437115,256,21053,427,94502,281,472
14Dec 29, 2022 10:4534,6941,784,044,24748,156,000239,801,000254,341,120
15Dec 29, 2022 10:4535,7611,862,345,11050,459,000246,359,000264,237,056