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 listMay 31, 2024 08:43GraceGraceScore: 6,604Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 31, 2024 08:436,569121,209,26154,526,62602,281,472
2May 31, 2024 08:436,573133,930,60454,552,40802,289,664
3May 31, 2024 08:436,575115,683,77654,574,71802,277,376
4May 31, 2024 08:436,575120,301,51154,572,75502,281,472
5May 31, 2024 08:436,579114,365,94354,608,03302,285,568
6May 31, 2024 08:436,582120,897,67254,626,77602,289,664
7May 31, 2024 08:436,604123,601,18854,810,91302,285,568
8May 31, 2024 08:436,610128,458,14154,859,64702,289,664
9May 31, 2024 08:436,635125,583,33455,074,60202,297,856
10May 31, 2024 08:436,647123,406,01455,172,28002,301,952
11May 31, 2024 08:436,659119,275,01555,267,26302,281,472
12May 31, 2024 08:436,745116,372,30655,982,40302,293,760