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 18, 2024 10:36Andrey LikhachevAndrey LikhachevScore: 12,362Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 18, 2024 10:3612,309126,123,326101,167,0001,001,0002,285,568
2Jul 18, 2024 10:3612,325123,084,314102,301,00002,367,488
3Jul 18, 2024 10:3612,326124,242,606102,309,00002,285,568
4Jul 18, 2024 10:3612,350125,345,106101,498,0001,004,0002,367,488
5Jul 18, 2024 10:3612,353125,609,095102,527,00002,285,568
6Jul 18, 2024 10:3612,356129,319,434102,555,00002,355,200
7Jul 18, 2024 10:3612,362133,535,608102,607,00002,285,568
8Jul 18, 2024 10:3612,384130,445,525101,788,000997,0002,281,472
9Jul 18, 2024 10:3612,400135,641,009100,920,0001,998,0002,375,680
10Jul 18, 2024 10:3612,521163,314,133103,927,69902,220,032
11Jul 18, 2024 10:3612,546172,126,917104,135,17002,236,416
12Jul 18, 2024 10:3612,961172,980,446107,575,98302,228,224