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 listJul 20, 2022 13:32MurkyMeowMurkyMeowScore: 1,642,407Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 20, 2022 13:321,641,61413,685,717,77113,625,395,10302,260,992
2Jul 20, 2022 13:321,642,40713,683,907,39813,631,976,54802,252,800
3Jul 20, 2022 13:321,652,33713,779,535,88613,714,393,51602,244,608