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 listJan 17, 2022 06:46Yuriy LyfenkoYuriy LyfenkoScore: 29,510Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 17, 2022 06:4629,407265,506,264242,078,0002,000,0002,523,136
2Jan 17, 2022 06:4629,501269,094,481240,861,0003,997,0002,527,232
3Jan 17, 2022 06:4629,503271,180,425242,876,0001,998,0002,318,336
4Jan 17, 2022 06:4629,504302,480,182244,883,08202,207,744
5Jan 17, 2022 06:4629,505308,207,166244,891,03002,220,032
6Jan 17, 2022 06:4629,509269,425,289240,928,0003,998,0002,527,232
7Jan 17, 2022 06:4629,510273,257,887242,934,0001,999,0002,326,528
8Jan 17, 2022 06:4629,511307,289,859244,939,95402,224,128
9Jan 17, 2022 06:4629,512277,513,089242,953,0001,999,0002,326,528
10Jan 17, 2022 06:4629,517274,040,176242,989,0001,999,0002,519,040
11Jan 17, 2022 06:4629,519273,336,965242,005,0003,000,0002,531,328
12Jan 17, 2022 06:4629,528269,881,162243,083,0002,000,0002,326,528