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 10, 2023 14:35Kevin HeaveyKevin HeaveyScore: 1,645,413Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 11, 2023 19:281,635,37813,650,964,00913,573,638,32602,260,992
2Jan 11, 2023 19:281,638,06413,671,467,03513,595,928,16202,252,800
3Jan 10, 2023 14:351,642,54613,695,859,82613,633,128,60202,256,896
4Jan 10, 2023 14:351,645,41313,719,447,77713,656,929,92402,265,088
5Jan 11, 2023 19:281,646,12513,725,750,20313,662,835,26702,260,992
6Jan 10, 2023 14:351,653,91113,780,816,72813,727,461,72902,256,896