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 listNov 11, 2024 09:10Anatoly ZhmurAnatoly ZhmurScore: 87,985Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 11, 2024 09:1087,229751,588,384641,999,00081,999,0002,519,040
2Nov 11, 2024 09:1087,265748,941,488635,388,00088,914,0002,535,424
3Nov 11, 2024 09:1087,543759,796,288641,654,00084,954,0002,519,040
4Nov 11, 2024 09:1087,635757,032,742642,441,00084,926,0002,539,520
5Nov 11, 2024 09:1087,985756,438,370642,363,00087,912,0002,531,328
6Nov 11, 2024 09:1088,000753,904,060641,472,00088,926,0002,535,424
7Nov 11, 2024 09:1088,058760,475,116644,894,00085,985,0002,510,848
8Nov 11, 2024 09:1088,204759,085,461642,207,00089,889,0002,478,080
9Nov 11, 2024 09:1088,367758,873,466646,510,00086,934,0002,547,712