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:25Alexander KimAlexander KimScore: 22,624Success
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:2522,563273,711,051187,276,96902,199,552
2Dec 30, 2022 01:2522,582257,152,439187,432,56902,203,648
3Dec 30, 2022 01:2522,584268,874,155187,449,41202,207,744
4Dec 30, 2022 01:2522,592212,150,217186,512,0001,002,0002,326,528
5Dec 30, 2022 01:2522,597215,637,476187,556,00002,326,528
6Dec 30, 2022 01:2522,608212,313,512185,640,0002,006,0002,383,872
7Dec 30, 2022 01:2522,624213,824,040186,784,000998,0002,441,216
8Dec 30, 2022 01:2522,628215,296,825185,815,0001,998,0002,326,528
9Dec 30, 2022 01:2522,635216,482,972184,873,0002,997,0002,326,528
10Dec 30, 2022 01:2522,636218,314,624184,879,0002,998,0002,383,872
11Dec 30, 2022 01:2522,644218,686,700186,948,000999,0002,326,528
12Dec 30, 2022 01:2522,673211,644,064185,185,0003,003,0002,383,872