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 listDec 21, 2024 05:12rimuspprimusppScore: 84,569Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 21, 2024 05:1284,049718,527,694696,610,000999,0002,486,272
2Dec 21, 2024 05:1284,051723,919,190696,626,000999,0002,260,992
3Dec 21, 2024 05:1284,067723,329,376696,759,000999,0002,260,992
4Dec 21, 2024 05:1284,299718,459,224699,680,00002,482,176
5Dec 21, 2024 05:1284,569723,329,504701,922,00002,490,368
6Dec 21, 2024 05:1284,599725,764,783702,173,00002,260,992
7Dec 21, 2024 05:1284,603727,507,540702,204,00002,482,176
8Dec 21, 2024 05:1284,650728,480,699701,599,000999,0002,478,080
9Dec 21, 2024 05:1284,695733,528,517702,971,00002,527,232