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 12, 2024 14:43Dmitrii KravchenkoDmitrii KravchenkoScore: 43,675Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 12, 2024 14:4343,621392,649,933360,051,0002,000,0002,355,200
2Sep 12, 2024 14:4343,675390,933,369360,502,0001,997,0002,363,392
3Sep 12, 2024 14:4343,693390,055,643360,655,0001,998,0002,269,184