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 listOct 11, 2024 01:42Joad NacerJoad NacerError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 11, 2024 01:4200000Error: expected "53690057395896111 ", got "53690062284953851 "stderr
2Oct 11, 2024 01:4300000Error: expected "53689590696651955 ", got "53689605830608044 "stderr
3Oct 11, 2024 01:4300000Error: expected "53688233748927601 ", got "53688239194919319 "stderr
4Oct 11, 2024 01:4300000Error: expected "53693154128165264 ", got "53693158419143087 "stderr
5Oct 11, 2024 01:434,47659,734,77935,146,0002,008,0002,334,720
6Oct 11, 2024 01:444,47770,925,33935,148,0002,008,0002,334,720
7Oct 11, 2024 01:444,49063,289,45934,246,0003,021,0002,514,944
8Oct 11, 2024 01:434,49760,198,54036,313,0001,008,0002,514,944
9Oct 11, 2024 01:434,50058,717,42734,320,0003,028,0002,510,848
10Oct 11, 2024 01:444,50665,183,79534,367,0003,032,0002,334,720