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 19, 2022 15:44Yuriy LyfenkoYuriy LyfenkoScore: 21,201Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 19, 2022 15:4420,741240,779,929172,153,59002,240,512
2Jul 19, 2022 15:4420,749243,806,478172,216,28802,240,512
3Jul 19, 2022 15:4420,754231,694,636172,257,13502,232,320
4Jul 19, 2022 15:4421,193205,788,236173,907,0001,998,0002,273,280
5Jul 19, 2022 15:4421,193201,079,288173,907,0001,998,0002,498,560
6Jul 19, 2022 15:4421,197203,253,286174,940,000999,0002,273,280
7Jul 19, 2022 15:4421,201199,643,985173,966,0001,999,0002,269,184
8Jul 19, 2022 15:4421,206199,138,294174,006,0002,000,0002,355,200
9Jul 19, 2022 15:4421,207198,918,489175,019,0001,000,0002,506,752
10Jul 19, 2022 15:4421,207204,959,239174,017,0002,000,0002,498,560
11Jul 19, 2022 15:4421,209203,175,355174,037,0002,000,0002,494,464
12Jul 19, 2022 15:4421,210198,674,324174,045,0002,000,0002,498,560