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 15:38Yuriy LyfenkoYuriy LyfenkoScore: 9,928Success
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 15:389,596113,470,46376,620,0003,024,0002,510,848
2Jul 30, 2022 15:389,599107,591,59673,695,0005,975,0002,424,832
3Jul 30, 2022 15:389,610108,372,39376,776,0002,991,0002,387,968
4Jul 30, 2022 15:389,770105,050,71877,087,0004,004,0002,342,912
5Jul 30, 2022 15:389,787105,087,07478,220,0003,008,0002,523,136
6Jul 30, 2022 15:389,857109,423,53975,830,0005,986,0002,330,624
7Jul 30, 2022 15:389,928106,078,23077,382,0005,024,0002,301,952
8Jul 30, 2022 15:389,945141,535,87582,541,41602,228,224
9Jul 30, 2022 15:389,997147,115,29082,972,16602,273,280
10Jul 30, 2022 15:3810,025105,691,77279,195,0004,009,0002,322,432
11Jul 30, 2022 15:3810,258144,625,88185,141,81202,215,936
12Jul 30, 2022 15:3810,343116,831,42480,855,0004,991,0002,367,488