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 listJan 25, 2024 11:45AnSaAnSaScore: 55,309Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 25, 2024 11:4646,465449,100,923385,658,87702,277,376
2Jan 25, 2024 11:4646,467424,491,257385,676,81202,281,472
3Jan 25, 2024 11:4646,508448,060,251386,020,39102,285,568
4Jan 25, 2024 11:4655,298534,909,137458,970,17702,285,568
5Jan 25, 2024 11:4655,309497,240,415459,061,93302,281,472
6Jan 25, 2024 11:4555,316533,444,870459,126,09002,285,568
7Jan 25, 2024 11:4555,317531,022,351459,130,43602,293,760
8Jan 25, 2024 11:4655,320517,547,691459,152,85702,277,376
9Jan 25, 2024 11:4555,339527,447,094459,316,65302,281,472