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 5, 2021 10:49Andrey TsvetkovAndrey TsvetkovScore: 50,641Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 5, 2021 10:4850,621487,543,238420,154,11002,252,800
2Sep 5, 2021 10:4850,628493,695,426420,215,55802,256,896
3Sep 5, 2021 10:4950,632494,978,779420,242,35902,256,896
4Sep 5, 2021 10:4950,641478,209,342420,317,62202,252,800
5Sep 5, 2021 10:4950,647483,098,399420,370,64802,260,992
6Sep 5, 2021 10:4850,670480,238,255420,563,38202,260,992