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 30, 2022 16:02Yuriy LyfenkoYuriy LyfenkoScore: 10,653Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 30, 2022 16:029,820144,014,81881,507,54602,240,512
2Jul 30, 2022 16:029,985165,916,94382,878,76202,215,936
3Jul 30, 2022 16:0210,194153,818,38184,606,67602,195,456
4Jul 30, 2022 16:0210,584115,913,19482,857,0004,991,0002,482,176
5Jul 30, 2022 16:0210,586113,426,82785,869,0001,996,0002,416,640
6Jul 30, 2022 16:0210,593116,213,91183,922,0003,996,0002,396,160
7Jul 30, 2022 16:0210,653110,244,45684,398,0004,018,0002,347,008
8Jul 30, 2022 16:0210,664121,202,96386,502,0002,011,0002,285,568
9Jul 30, 2022 16:0210,693113,993,13185,764,0002,991,0002,416,640
10Jul 30, 2022 16:0210,724111,462,42386,006,0003,000,0002,482,176
11Jul 30, 2022 16:0210,859113,146,48987,127,0003,004,0002,265,088
12Jul 30, 2022 16:0211,002119,136,80485,299,0006,021,0002,404,352