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 18:10Yuriy LyfenkoYuriy LyfenkoScore: 17,611Success
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 18:1017,386210,133,964144,303,27102,281,472
2Jul 15, 2022 18:1017,388215,533,938144,320,23302,277,376
3Jul 15, 2022 18:1017,562171,932,517143,770,0001,996,0002,277,376
4Jul 15, 2022 18:1017,564170,915,016143,783,0001,996,0002,285,568
5Jul 15, 2022 18:1017,582174,255,386143,929,0001,999,0002,285,568
6Jul 15, 2022 18:1017,599171,272,917145,074,0001,000,0002,285,568
7Jul 15, 2022 18:1017,611168,309,949144,170,0002,002,0002,277,376
8Jul 15, 2022 18:1017,617169,461,882144,215,0002,002,0002,273,280
9Jul 15, 2022 18:1017,643171,754,297145,434,0001,002,0002,285,568
10Jul 15, 2022 18:1017,705220,853,301146,947,96702,281,472
11Jul 15, 2022 18:1017,853169,817,603146,180,0002,002,0002,285,568
12Jul 15, 2022 18:1020,092191,669,932166,761,00002,269,184