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 listOct 10, 2024 23:30Joad NacerJoad NacerScore: 7,891Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 10, 2024 23:307,72185,628,18261,082,0003,004,0002,363,392
2Oct 10, 2024 23:307,72885,673,30461,134,0003,006,0002,334,720
3Oct 10, 2024 23:307,72891,260,41762,142,0002,004,0002,334,720
4Oct 10, 2024 23:307,89187,111,72865,496,00002,330,624
5Oct 10, 2024 23:307,89190,070,02165,492,00002,510,848
6Oct 10, 2024 23:307,90195,372,44063,564,0002,017,0002,502,656