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 17, 2022 14:36Yuriy LyfenkoYuriy LyfenkoScore: 27,113Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 17, 2022 14:3627,102253,341,760222,949,0001,999,0002,457,600
2Jan 17, 2022 14:3627,102251,020,775221,945,0002,999,0002,469,888
3Jan 17, 2022 14:3627,103251,813,424221,956,0002,999,0002,281,472
4Jan 17, 2022 14:3627,104255,287,197221,965,0002,999,0002,469,888
5Jan 17, 2022 14:3627,110247,280,109222,014,0003,000,0002,543,616
6Jan 17, 2022 14:3627,113248,776,875223,039,0002,000,0002,465,792
7Jan 17, 2022 14:3627,113250,367,594223,041,0002,000,0002,469,888
8Jan 17, 2022 14:3627,118258,800,612222,076,0003,001,0002,539,520
9Jan 17, 2022 14:3627,120254,022,781221,096,0004,001,0002,465,792
10Jan 17, 2022 14:3627,122287,796,610225,112,96402,179,072
11Jan 17, 2022 14:3627,130283,739,126225,177,16402,195,456
12Jan 17, 2022 14:3627,332301,279,857226,855,59602,195,456