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 1, 2023 21:40sliceteamsliceteamScore: 13,117Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 1, 2023 21:4013,107138,281,987107,783,0001,007,0002,260,992
2Oct 1, 2023 21:4013,108134,615,365107,800,000998,0002,387,968
3Oct 1, 2023 21:4013,111138,707,655107,812,0001,007,0002,260,992
4Oct 1, 2023 21:4013,112133,276,536106,837,0001,996,0002,260,992
5Oct 1, 2023 21:4013,112134,186,226108,830,00002,260,992
6Oct 1, 2023 21:4013,113134,948,032106,840,0001,997,0002,392,064
7Oct 1, 2023 21:4013,117135,034,483106,876,0001,997,0002,392,064
8Oct 1, 2023 21:4013,123134,713,171106,923,0001,998,0002,392,064
9Oct 1, 2023 21:4013,136136,096,405107,032,0002,000,0002,383,872
10Oct 1, 2023 21:4013,398168,312,131111,203,50802,273,280
11Oct 1, 2023 21:4013,423172,112,841111,411,10102,281,472
12Oct 1, 2023 21:4013,425172,274,720111,431,15502,269,184