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 listNov 10, 2024 15:55zielajzielajScore: 6,855Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 10, 2024 15:556,69476,588,87754,551,0001,010,0002,428,928
2Nov 10, 2024 15:556,70678,950,79153,671,0001,987,0002,535,424
3Nov 10, 2024 15:556,71284,136,21755,710,00002,428,928
4Nov 10, 2024 15:556,71783,464,60054,760,000995,0002,535,424
5Nov 10, 2024 15:556,80375,535,96355,461,0001,008,0002,428,928
6Nov 10, 2024 15:556,84682,168,14354,831,0001,993,0002,428,928
7Nov 10, 2024 15:556,85586,994,21054,899,0001,996,0002,535,424
8Nov 10, 2024 15:556,93987,667,74556,580,0001,010,0002,428,928
9Nov 10, 2024 15:557,09181,155,63056,861,0001,995,0002,273,280
10Nov 10, 2024 15:558,09891,703,09866,211,0001,003,0002,433,024
11Nov 10, 2024 15:558,17592,057,58566,852,000997,0002,531,328
12Nov 10, 2024 15:558,61994,886,42871,536,00002,531,328