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 listSep 1, 2023 22:11Ignas BagdonasIgnas BagdonasScore: 18,342Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 1, 2023 22:1118,204220,095,263151,090,49702,199,552
2Sep 1, 2023 22:1118,219216,814,099151,220,73702,191,360
3Sep 1, 2023 22:1118,284240,577,216151,759,56602,187,264
4Sep 1, 2023 22:1118,299175,564,686150,885,000999,0002,523,136
5Sep 1, 2023 22:1118,312176,192,373149,987,0001,999,0002,445,312
6Sep 1, 2023 22:1118,320174,479,654151,058,0001,000,0002,433,024
7Sep 1, 2023 22:1118,342175,635,402152,242,00002,441,216
8Sep 1, 2023 22:1118,380179,247,962152,557,00002,523,136
9Sep 1, 2023 22:1118,431175,110,218149,977,0002,999,0002,441,216
10Sep 1, 2023 22:1118,431180,399,744151,978,000999,0002,527,232
11Sep 1, 2023 22:1118,442176,275,409152,065,0001,000,0002,523,136
12Sep 1, 2023 22:1118,461174,087,874153,223,00002,527,232