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 listFeb 25, 2024 17:21sliceteamsliceteamScore: 13,016Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 25, 2024 17:2112,871131,809,937105,833,000998,0002,400,256
2Feb 25, 2024 17:2112,886133,353,130105,953,000999,0002,523,136
3Feb 25, 2024 17:2112,920134,096,221105,234,0002,004,0002,277,376
4Feb 25, 2024 17:2112,930136,566,721106,319,0001,003,0002,506,752
5Feb 25, 2024 17:2112,940136,059,199105,393,0002,007,0002,453,504
6Feb 25, 2024 17:2113,010130,315,419105,983,0001,999,0002,519,040
7Feb 25, 2024 17:2113,016135,780,314105,035,0003,001,0002,326,528
8Feb 25, 2024 17:2113,232135,474,051107,827,0001,996,0002,265,088
9Feb 25, 2024 17:2113,288136,820,550108,282,0002,005,0002,306,048
10Feb 25, 2024 17:2120,134228,623,825167,111,30902,281,472
11Feb 25, 2024 17:2120,376222,848,082169,119,20802,260,992
12Feb 25, 2024 17:2120,803229,164,618172,661,58202,199,552