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 listDec 30, 2022 01:28Alexander KimAlexander KimScore: 22,622Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 30, 2022 01:2822,555246,425,993187,203,79302,203,648
2Dec 30, 2022 01:2822,580253,260,022187,417,62002,207,744
3Dec 30, 2022 01:2822,595213,501,415185,530,0002,005,0002,326,528
4Dec 30, 2022 01:2822,596211,132,213184,535,0003,008,0002,326,528
5Dec 30, 2022 01:2822,605246,956,377187,621,09702,195,456
6Dec 30, 2022 01:2822,619212,442,778184,746,0002,995,0002,498,560
7Dec 30, 2022 01:2822,622209,970,322184,767,0002,996,0002,437,120
8Dec 30, 2022 01:2822,622213,912,623185,765,0001,997,0002,326,528
9Dec 30, 2022 01:2822,624217,903,908184,787,0002,996,0002,326,528
10Dec 30, 2022 01:2822,625209,589,171186,787,000998,0002,383,872
11Dec 30, 2022 01:2822,647215,644,868185,969,0001,999,0002,326,528
12Dec 30, 2022 01:2822,676213,242,141185,204,0003,003,0002,387,968