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 listJun 12, 2023 16:10Dmitry MakarovDmitry MakarovScore: 1,646,536Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 12, 2023 16:061,642,06113,691,945,86113,629,109,35302,260,992
2Jun 12, 2023 16:061,644,09613,717,608,40813,645,997,64002,248,704
3Jun 12, 2023 16:101,645,36013,711,626,10413,656,492,07902,260,992
4Jun 12, 2023 16:061,646,53613,728,844,49413,666,247,55102,244,608
5Jun 12, 2023 16:101,662,08013,861,343,70613,795,262,24402,252,800
6Jun 12, 2023 16:101,698,51914,161,248,26214,097,705,44102,256,896