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 01:32Yuriy LyfenkoYuriy LyfenkoScore: 13,424Success
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 01:3213,398143,757,339109,197,0002,003,0002,285,568
2Jul 16, 2022 01:3213,402133,797,330109,229,0002,004,0002,273,280
3Jul 16, 2022 01:3213,405136,448,344111,265,00002,277,376
4Jul 16, 2022 01:3213,417132,209,496110,362,0001,003,0002,273,280
5Jul 16, 2022 01:3213,419134,601,368110,372,0001,003,0002,285,568
6Jul 16, 2022 01:3213,420140,689,735110,385,0001,003,0002,285,568
7Jul 16, 2022 01:3213,424133,771,040111,422,00002,531,328
8Jul 16, 2022 01:3213,427136,270,392110,442,0001,004,0002,289,664
9Jul 16, 2022 01:3213,432141,112,633111,489,00002,285,568
10Jul 16, 2022 01:3218,929208,072,606157,109,69202,277,376
11Jul 16, 2022 01:3218,931222,187,270157,129,97102,252,800
12Jul 16, 2022 01:3218,935211,705,849157,162,61402,281,472