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 21, 2024 19:13KrishanKrishanScore: 57,551Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 21, 2024 19:1357,496505,372,026477,217,00002,371,584
2Nov 21, 2024 19:1357,512502,225,047476,350,0001,000,0002,293,760
3Nov 21, 2024 19:1357,515509,815,634476,371,0001,000,0002,285,568
4Nov 21, 2024 19:1357,544508,222,596475,619,0001,998,0002,285,568
5Nov 21, 2024 19:1357,551507,298,934476,675,000999,0002,289,664
6Nov 21, 2024 19:1357,554503,439,583475,698,0001,998,0002,461,696
7Nov 21, 2024 19:1357,585504,712,115476,953,000999,0002,293,760
8Nov 21, 2024 19:1357,586510,859,133475,962,0001,999,0002,293,760
9Nov 21, 2024 19:1357,595499,945,766477,038,0001,000,0002,371,584