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 listApr 27, 2024 14:43Anoushk KharangateAnoushk KharangateScore: 91,175Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 27, 2024 14:1891,032827,751,396755,569,42802,199,552
2Apr 27, 2024 14:1891,047809,878,645755,692,69802,211,840
3Apr 27, 2024 14:4391,083815,490,289755,989,44302,211,840
4Apr 27, 2024 14:4191,162818,592,348756,642,17402,203,648
5Apr 27, 2024 14:4191,175829,097,671756,754,53502,211,840
6Apr 27, 2024 14:4391,210813,659,983757,046,40802,207,744
7Apr 27, 2024 14:1891,227817,225,339757,187,55402,207,744
8Apr 27, 2024 14:4391,278832,908,329757,604,52202,195,456
9Apr 27, 2024 14:4191,546825,052,997759,832,19902,203,648