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 listJun 13, 2021 21:21evgenikwtevgenikwtScore: 28,136Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 13, 2021 21:2127,506280,350,458228,298,78302,248,704
2Jun 13, 2021 21:2127,982285,538,641232,249,73402,244,608
3Jun 13, 2021 21:2127,993304,349,768232,342,09002,252,800
4Jun 13, 2021 21:2128,028261,797,322230,633,0001,996,0002,256,896
5Jun 13, 2021 21:2128,074261,825,339231,012,0002,000,0002,371,584
6Jun 13, 2021 21:2128,113260,363,831232,334,0001,001,0002,519,040
7Jun 13, 2021 21:2128,136263,781,453232,527,0001,002,0002,375,680
8Jun 13, 2021 21:2128,581262,162,506236,224,0001,000,0002,260,992
9Jun 13, 2021 21:2128,593263,757,954236,325,0001,001,0002,260,992
10Jun 13, 2021 21:2128,659266,889,709235,868,0001,998,0002,519,040
11Jun 13, 2021 21:2128,678263,035,381237,026,0001,000,0002,379,776
12Jun 13, 2021 21:2128,679268,148,173238,038,00002,256,896