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 listJan 10, 2022 07:16Yuriy LyfenkoYuriy LyfenkoScore: 11,462Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 10, 2022 07:1611,446118,470,19893,000,0002,000,0002,269,184
2Jan 10, 2022 07:1611,450117,728,64593,037,0002,000,0002,289,664
3Jan 10, 2022 07:1611,456117,817,93193,085,0002,001,0002,281,472
4Jan 10, 2022 07:1611,457121,780,50793,094,0002,002,0002,289,664
5Jan 10, 2022 07:1611,457119,904,08393,094,0002,002,0002,289,664
6Jan 10, 2022 07:1611,458118,662,92793,101,0002,002,0002,289,664
7Jan 10, 2022 07:1611,462120,843,84893,135,0002,002,0002,289,664
8Jan 10, 2022 07:1611,462117,839,36593,136,0002,002,0002,289,664
9Jan 10, 2022 07:1611,467116,207,74794,177,0001,001,0002,273,280
10Jan 10, 2022 07:1612,681168,420,742105,248,60102,269,184
11Jan 10, 2022 07:1612,685172,185,621105,283,58502,273,280
12Jan 10, 2022 07:1613,028164,001,136108,128,99902,277,376