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 05:41Yuriy LyfenkoYuriy LyfenkoScore: 11,216Success
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 05:4111,207115,470,72291,017,0002,000,0002,289,664
2Jul 16, 2022 05:4111,207114,464,67691,018,0002,000,0002,289,664
3Jul 16, 2022 05:4111,209118,284,43891,038,0002,000,0002,281,472
4Jul 16, 2022 05:4111,213117,072,57191,069,0002,001,0002,289,664
5Jul 16, 2022 05:4111,213115,554,67891,071,0002,001,0002,289,664
6Jul 16, 2022 05:4111,215115,489,42191,083,0002,001,0002,265,088
7Jul 16, 2022 05:4111,216120,176,44092,093,0001,001,0002,289,664
8Jul 16, 2022 05:4111,216121,135,62391,094,0002,002,0002,269,184
9Jul 16, 2022 05:4111,216117,424,12891,093,0002,002,0002,281,472
10Jul 16, 2022 05:4111,813161,267,22998,044,83102,273,280
11Jul 16, 2022 05:4111,825155,435,60898,148,84302,277,376
12Jul 16, 2022 05:4111,826153,936,03998,153,83602,265,088