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 14, 2021 15:19Yuriy LyfenkoYuriy LyfenkoScore: 13,117Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 14, 2021 15:1913,095388,450,341107,691,000997,0002,510,848
2Jul 14, 2021 15:1913,098386,436,368106,722,0001,994,0002,523,136
3Jul 14, 2021 15:1913,100385,728,887108,733,00002,383,872
4Jul 14, 2021 15:1913,101386,677,263107,741,000997,0002,523,136
5Jul 14, 2021 15:1913,110392,829,773106,821,0001,996,0002,392,064
6Jul 14, 2021 15:1913,115384,920,683106,857,0001,997,0002,523,136
7Jul 14, 2021 15:1913,117391,168,372106,874,0001,997,0002,273,280
8Jul 14, 2021 15:1913,118386,447,165107,884,000998,0002,387,968
9Jul 14, 2021 15:1913,155380,359,435108,182,0001,001,0002,260,992
10Jul 14, 2021 15:1913,267428,697,616110,112,56502,244,608
11Jul 14, 2021 15:1913,281431,263,180110,232,16602,256,896
12Jul 14, 2021 15:1913,284425,002,793110,255,65302,240,512