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:39sliceteamsliceteamScore: 13,070Success
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:3912,866181,609,049106,786,01302,269,184
2Oct 1, 2023 21:3912,869168,634,023106,812,84402,265,088
3Oct 1, 2023 21:3912,909175,119,968107,144,73102,281,472
4Oct 1, 2023 21:3913,050131,883,684107,311,0001,002,0002,527,232
5Oct 1, 2023 21:3913,057138,471,180107,368,0001,003,0002,387,968
6Oct 1, 2023 21:3913,068128,426,293107,462,0001,004,0002,260,992
7Oct 1, 2023 21:3913,070135,109,845107,480,0001,004,0002,383,872
8Oct 1, 2023 21:3913,070135,384,813107,478,0001,004,0002,260,992
9Oct 1, 2023 21:3913,070134,212,634108,485,00002,260,992
10Oct 1, 2023 21:3913,072129,851,655107,493,0001,004,0002,383,872
11Oct 1, 2023 21:3913,072133,671,135107,494,0001,004,0002,260,992
12Oct 1, 2023 21:3913,095139,242,882108,688,00002,260,992