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 listApr 13, 2024 16:41E SequeiraE SequeiraScore: 19,878Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 13, 2024 16:4119,825239,727,507164,548,93902,240,512
2Apr 13, 2024 16:4119,830191,346,585163,587,0001,003,0002,285,568
3Apr 13, 2024 16:4119,854188,511,984163,794,000998,0002,285,568
4Apr 13, 2024 16:4119,859190,831,954162,831,0001,997,0002,506,752
5Apr 13, 2024 16:4119,873193,191,657163,944,000999,0002,506,752
6Apr 13, 2024 16:4119,873189,717,954162,947,0001,999,0002,285,568
7Apr 13, 2024 16:4119,878197,897,449162,988,0001,999,0002,510,848
8Apr 13, 2024 16:4119,880193,483,227163,006,0002,000,0002,506,752
9Apr 13, 2024 16:4119,885187,941,313163,049,0002,000,0002,285,568
10Apr 13, 2024 16:4119,887187,279,071163,061,0002,000,0002,502,656
11Apr 13, 2024 16:4120,199235,003,368167,648,74802,236,416
12Apr 13, 2024 16:4120,203230,897,861167,687,01502,232,320