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 15, 2022 16:54Yuriy LyfenkoYuriy LyfenkoScore: 11,794Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 15, 2022 16:5411,778123,229,54895,766,0001,995,0002,277,376
2Jul 15, 2022 16:5411,780121,405,66295,783,0001,995,0002,285,568
3Jul 15, 2022 16:5411,783127,819,00495,800,0001,995,0002,285,568
4Jul 15, 2022 16:5411,788120,897,71896,839,000998,0002,285,568
5Jul 15, 2022 16:5411,791120,992,98796,868,000998,0002,285,568
6Jul 15, 2022 16:5411,791125,206,01195,870,0001,997,0002,285,568
7Jul 15, 2022 16:5411,794121,878,84495,897,0001,997,0002,285,568
8Jul 15, 2022 16:5411,803122,414,27595,970,0001,999,0002,367,488
9Jul 15, 2022 16:5411,905156,448,44898,808,43102,281,472
10Jul 15, 2022 16:5411,928165,322,44899,001,50202,289,664
11Jul 15, 2022 16:5411,930169,687,78399,022,09702,277,376
12Jul 15, 2022 16:5412,079123,782,73598,247,0002,005,0002,285,568