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 listFeb 14, 2023 21:44LiamLiamScore: 1,641,805Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 14, 2023 21:441,636,09613,642,346,44913,579,592,75502,256,896
2Feb 14, 2023 21:441,639,09313,662,109,09313,604,468,53802,256,896
3Feb 14, 2023 21:441,641,14813,683,392,74813,621,529,63502,260,992
4Feb 14, 2023 21:441,641,18313,679,369,97213,621,819,75102,256,896
5Feb 14, 2023 21:441,641,80513,709,612,37113,626,981,68202,256,896
6Feb 14, 2023 21:441,641,97213,693,488,28013,628,367,00702,256,896
7Feb 14, 2023 21:441,643,11013,695,176,79213,637,812,59502,248,704
8Feb 14, 2023 21:441,648,63813,788,086,87613,683,693,64802,260,992
9Feb 14, 2023 21:441,650,49013,779,301,86113,699,069,00602,252,800