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 14:29ndbnndbnScore: 121,745Success
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 14:29121,5461,027,398,571917,845,00090,984,0002,461,696
2Nov 11, 2024 14:29121,5571,035,186,385917,928,00090,992,0002,457,600
3Nov 11, 2024 14:29121,6531,032,607,354909,748,00099,972,0002,281,472
4Nov 11, 2024 14:29121,7451,032,763,262929,523,00080,958,0002,281,472
5Nov 11, 2024 14:29121,7451,031,822,051921,533,00088,954,0002,281,472
6Nov 11, 2024 14:29121,7861,033,769,064921,840,00088,984,0002,457,600
7Nov 11, 2024 14:29121,8151,033,281,074912,062,00099,006,0002,273,280
8Nov 11, 2024 14:29121,8291,033,406,851936,168,00075,013,0002,281,472
9Nov 11, 2024 14:29121,8941,038,764,192930,743,00080,977,0002,281,472