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 listOct 14, 2024 11:31Joad NacerJoad NacerScore: 4,362Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 14, 2024 11:314,29062,934,97135,603,00002,301,952
2Oct 14, 2024 11:314,31758,502,58734,834,000995,0002,289,664
3Oct 14, 2024 11:324,32454,479,88632,900,0002,990,0002,273,280
4Oct 14, 2024 11:324,34767,579,16034,074,0002,004,0002,453,504
5Oct 14, 2024 11:324,36268,728,87634,192,0002,011,0002,273,280
6Oct 14, 2024 11:314,43963,491,65235,846,000995,0002,297,856
7Oct 14, 2024 11:314,51265,109,89936,437,0001,012,0002,306,048
8Oct 14, 2024 11:314,60059,807,27535,169,0003,014,0002,273,280
9Oct 14, 2024 11:314,65567,408,67636,606,0002,033,0002,306,048