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 22, 2024 23:26Mikhail ShirokovMikhail ShirokovScore: 51,914Success
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, 2024 11:2851,858451,902,514429,423,0001,000,0002,265,088
2Sep 5, 2024 11:2851,888454,023,290428,675,0001,998,0002,269,184
3Oct 22, 2024 23:2651,891455,393,936428,700,0001,998,0002,265,088
4Oct 22, 2024 23:2651,914456,067,256428,886,0001,999,0002,359,296
5Oct 22, 2024 23:2651,918458,518,608428,919,0001,999,0002,273,280
6Sep 5, 2024 11:2851,923455,403,846428,959,0001,999,0002,289,664