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 listSep 20, 2024 16:19Dibash ThapaDibash ThapaScore: 68,030Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 20, 2024 16:1967,983585,547,720501,233,00063,029,0002,281,472
2Sep 20, 2024 16:1968,003590,767,975510,481,00053,945,0002,375,680
3Sep 20, 2024 16:1968,022598,903,531499,633,00064,952,0002,363,392
4Sep 20, 2024 16:1968,025597,076,466492,659,00071,950,0002,367,488
5Sep 20, 2024 16:1968,030590,214,531498,692,00065,959,0002,371,584
6Sep 20, 2024 16:1968,054590,652,445494,867,00069,981,0002,367,488
7Sep 20, 2024 16:1968,088587,703,921504,118,00061,014,0002,289,664
8Sep 20, 2024 16:1968,099594,397,134497,192,00068,026,0002,367,488
9Sep 20, 2024 16:1968,118593,147,978509,340,00056,037,0002,289,664