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 listApr 16, 2024 15:36Matt StuchlikMatt StuchlikScore: 11,106Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 16, 2024 15:5910,997149,338,88491,274,10502,277,376
2Apr 16, 2024 15:5911,025162,196,95791,509,17302,265,088
3Apr 16, 2024 15:3611,094157,883,91392,080,62202,269,184
4Apr 16, 2024 15:3611,095157,348,74592,089,06602,256,896
5Apr 16, 2024 15:5911,106154,113,58792,175,98002,269,184
6Apr 16, 2024 15:3611,108157,837,39292,192,68402,265,088
7Apr 16, 2024 15:5811,110162,569,71792,213,02002,273,280
8Apr 16, 2024 15:5811,111147,109,90692,217,23302,265,088
9Apr 16, 2024 15:5811,126152,148,11992,344,99002,269,184