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 31, 2022 03:39Robert BurkeRobert BurkeScore: 8,147Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 31, 2022 03:398,06287,438,53965,914,000998,0002,428,928
2Jul 31, 2022 03:398,06387,754,75465,928,000998,0002,424,832
3Jul 31, 2022 03:398,06887,746,55364,967,0001,998,0002,277,376
4Jul 31, 2022 03:398,13287,626,58467,492,00002,437,120
5Jul 31, 2022 03:398,13289,320,32067,499,00002,433,024
6Jul 31, 2022 03:398,14092,216,52267,562,00002,535,424
7Jul 31, 2022 03:398,14092,751,23167,565,00002,277,376
8Jul 31, 2022 03:398,14790,419,46167,624,00002,277,376
9Jul 31, 2022 03:398,14989,867,10266,639,000994,0002,433,024
10Jul 31, 2022 03:398,17090,690,61167,807,00002,273,280
11Jul 31, 2022 03:398,19597,599,15767,018,0001,000,0002,277,376
12Jul 31, 2022 03:398,21590,409,10166,183,0002,005,0002,273,280
13Jul 31, 2022 03:398,597130,607,21571,357,47302,297,856
14Jul 31, 2022 03:398,599132,013,95271,373,70802,170,880
15Jul 31, 2022 03:398,640130,767,32471,713,95602,301,952