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 6, 2024 12:57zielajzielajScore: 11,364Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 6, 2024 12:5711,358116,626,41494,271,00002,531,328
2Nov 6, 2024 12:5711,360120,288,17293,282,0001,003,0002,535,424
3Nov 6, 2024 12:5711,360118,278,82294,285,00002,531,328
4Nov 6, 2024 12:5711,361121,002,14893,291,0001,003,0002,273,280
5Nov 6, 2024 12:5711,362118,486,13894,306,00002,535,424
6Nov 6, 2024 12:5711,362123,635,08694,301,00002,531,328
7Nov 6, 2024 12:5711,364117,783,11393,319,0001,003,0002,535,424
8Nov 6, 2024 12:5711,365121,875,56893,327,0001,003,0002,437,120
9Nov 6, 2024 12:5711,366121,386,70993,331,0001,003,0002,514,944
10Nov 6, 2024 12:5711,367113,441,66093,345,0001,003,0002,420,736
11Nov 6, 2024 12:5711,374116,861,93793,401,0001,004,0002,428,928
12Nov 6, 2024 12:5711,394116,415,84394,573,00002,437,120