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 16, 2022 03:31Yuriy LyfenkoYuriy LyfenkoScore: 11,217Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 16, 2022 03:3111,205114,077,03692,004,0001,000,0002,289,664
2Jul 16, 2022 03:3111,207117,645,76191,018,0002,000,0002,273,280
3Jul 16, 2022 03:3111,210121,854,15291,040,0002,000,0002,269,184
4Jul 16, 2022 03:3111,215118,353,49891,082,0002,001,0002,269,184
5Jul 16, 2022 03:3111,216117,384,88591,091,0002,002,0002,277,376
6Jul 16, 2022 03:3111,216118,368,51791,092,0002,002,0002,289,664
7Jul 16, 2022 03:3111,217120,954,87191,095,0002,002,0002,273,280
8Jul 16, 2022 03:3111,227121,608,55991,181,0002,003,0002,289,664
9Jul 16, 2022 03:3111,234115,558,28891,238,0002,005,0002,375,680
10Jul 16, 2022 03:3111,794154,645,23997,888,01002,277,376
11Jul 16, 2022 03:3111,794160,492,62097,892,63002,277,376
12Jul 16, 2022 03:3111,794154,129,90197,893,25002,273,280