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 26, 2024 23:18Joad NacerJoad NacerScore: 15,220Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 26, 2024 23:1815,115177,277,070125,457,55402,269,184
2Apr 26, 2024 23:1815,199147,432,325124,149,0002,002,0002,285,568
3Apr 26, 2024 23:1815,212152,228,596125,256,0001,002,0002,285,568
4Apr 26, 2024 23:1815,213148,438,711124,267,0002,004,0002,285,568
5Apr 26, 2024 23:1815,218151,959,107124,304,0002,004,0002,285,568
6Apr 26, 2024 23:1815,218146,384,346126,306,00002,289,664
7Apr 26, 2024 23:1815,220152,360,807124,325,0002,005,0002,277,376
8Apr 26, 2024 23:1815,247153,869,109125,546,0001,004,0002,510,848
9Apr 26, 2024 23:1815,249157,138,502125,559,0001,004,0002,510,848
10Apr 26, 2024 23:1815,437157,699,585126,125,0002,001,0002,510,848
11Apr 26, 2024 23:1815,719211,034,485130,470,31802,269,184
12Apr 26, 2024 23:1815,722208,395,170130,488,68902,281,472